#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <bitset>
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
#define REP(i,n) for(ll i=0; i<ll(n); i++)
template <class T> using V = vector<T>;
template <class A, class B> void chmax(A& l, const B& r){ if(l < r) l = r; }
template <class A, class B> void chmin(A& l, const B& r){ if(r < l) l = r; }

bitset<(1ll<<30)> X, Y;

void testcase(){
  ll N; cin >> N;
  V<ll> A(N); REP(i,N) cin >> A[i];
  REP(i,N) X.set(A[i]);
  Y = ~Y;
  for(ll k=29; k>=0; k--){
    Y &= Y >> (1ll << k);
    if(k != 29) Y |= Y << (2ll << k);
    X |= (X >> (1ll << k)) & Y;
  }
  cout << X.count() << "\n";
}

int main(){
  cin.tie(0)->sync_with_stdio(0);
  testcase();
  return 0;
}