#include <bits/stdc++.h>
const int N = 1e7 + 5;
int fa[N], n, ans;
void rd(int &x) {
  x = 0;
  char c;
  while (c = getchar(), c < 48)
    ;
  do x = (x << 3) + (x << 1) + (c ^ 48);
  while (c = getchar(), c > 47 && c < 58);
}
int findset(int x) { return fa[x] == x ? x : fa[x] = findset(fa[x]); }
void merge(int x, int y) {
  if (!fa[x] || !fa[y]) return;
  x = findset(x), y = findset(y);
  if (x == y) return;
  fa[x] = y;
  ans--;
}
int gcd(int x, int y) { return !y ? x : gcd(y, x % y); }
int main() {
  rd(n), ans = n;
  for (int i = 1, x; i <= n; i++) rd(x), fa[x] = x;
  for (long long y = 1; y <= 1e7; y++) {
    for (long long x = y + 1; 2 * x * y <= 1e7 && x * x - y * y <= 1e7; x++) {
      long long a = x * x - y * y, b = 2 * x * y, c = x * x + y * y;
      if (gcd(a, b) == 1) {
        merge(a, b);
        if (c <= 1e7) merge(a, c), merge(b, c);
      }
    }
  }
  printf("%lld", ans);
  return 0;
}
