WA5 AC12

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#define int long long
using namespace std;
const int N = 2e5 + 5;
const int INF = 0x3f3f3f3f;
int n, ans, num, sp, a[N], cnt[N];
signed main(){
	cin >> n;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
		for (int j = 1; j * j <= a[i]; j++)
			if (a[i] % (j * j) == 0)
				num = a[i] / (j * j);
		cnt[num]++;
		a[i] = num;
		cout << a[i] << " " << cnt[num] << endl;
	}
	for (int i = 1; i <= n; i++){
		if (a[i] == 0)
			sp += n - i;
		else
			ans += cnt[ a[i] ] - 1;
	}
	cout << ans / 2 + sp << endl;
	return 0;
}