#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair

const int INF = 1 << 24;
const int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};

typedef unsigned long long ull;
typedef std::pair<int,int> P;

bool isOdd2(ull n){
    for(ull i=3;i*i<=n;i+=2){
        if(n % i == 0 && (n / i + 1) % 2 == 0){
            return true;
        }
    }
    return false;
}

int main(){
    int N;
    std::cin >> N;

    int res = 0;
    REP(i, N){
        ull k;
        std::cin >> k;
        
        k = 2*k+1;
        if(!isOdd2(k)){
            res++;
        }
    }

    std::cout << res << std::endl;
}