#include <bits/stdc++.h>
using namespace std;
constexpr int N = 1e6 + 5, inf = 2e6, B = 2000;
int n, a[N], cnt[N];
int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	long long res = 0;
	for (int i = 1; i <= n; i++) {
		if (a[i] < B) {
			for (int j = 1; j <= n; j++) {
				int x = a[i] * a[i] + a[j];
				if ((int) sqrtl(x) * (int) sqrtl(x) == x) {
					res++;
				}
			}
		} else {
			long long x = 1ll * a[i] * a[i];
			long long y = sqrtl(x);
			if (y * y != x) y++;
			y *= y;
			y -= x;
			if (y < N) res += cnt[y];
		}
	}
	cout << res << "\n";
	return 0;
}