#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T> ostream &operator<<(ostream &os, const vector<T> &as);
template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


using U = unsigned long long;
constexpr int E = 30;
constexpr int F = 6;
constexpr int MASK = (1 << F) - 1;

int N;
vector<int> A;

int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) scanf("%d", &A[i]);
    
    vector<U> fs(1 << (E-F));
    for (int i = 0; i < N; ++i) fs[A[i] >> F] |= 1ULL << (A[i] & MASK);
    
    for (int e = 0; e < F; ++e) {
      U mask = 0;
      for (int p = 0; p < 1 << F; ++p) if (p >> e & 1) mask |= 1ULL << p;
      for (int q = 0; q < 1 << (E-F); ++q) fs[q] |= (fs[q] & mask) >> (1 << e);
    }
    for (int e = F; e < E; ++e) {
      const int d = e - F;
      for (int q0 = 0; q0 < 1 << (E-F); q0 += (1 << (d + 1))) for (int q = q0; q < q0 + (1 << d); ++q) fs[q] |= fs[q | 1 << d];
    }
    
    int ans = 0;
    for (int q = 0; q < 1 << (E-F); ++q) ans += __builtin_popcountll(fs[q]);
    printf("%d\n", ans);
  }
  return 0;
}