#include <bits/stdc++.h>
using namespace std;
int n, f[10000005], ans = 0;
int find(int x) { return (f[x] == x) ? x : f[x] = find(f[x]); }
int gcd(int x, int y) { return (y == 0) ? x : gcd(y, x % y); }
void connect(int a, int b) {
  int fx = find(a), fy = find(b);
  if (fx != fy) {
    ans--;
    f[fy] = fx;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    f[x] = x;
  }
  ans = n;
  int maxn = 1e7;
  for (long long y = 1; y <= maxn; y++)
    for (long long x = y + 1; (x * x - y * y <= maxn && 2 * x * y <= maxn);
         x++) {
      long long a = 2 * x * y, b = x * x - y * y, c = x * x + y * y;
      if (gcd(a, b) == 1) {
        if (f[a] && f[b]) connect(a, b);
        if (c <= maxn) {
          if (f[a] && f[c]) connect(a, c);
          if (f[b] && f[c]) connect(b, c);
        }
      }
    }
  cout << ans << endl;
  return 0;
}
