#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

const int MAX_N = (1 << 19) + 10;

int v[MAX_N];

int main()
{
  cin.sync_with_stdio(false);
  int n;
  cin >> n;
  for(int i = 1; i <= n; i++) {
    cin >> v[i];
  }

  int s = 0;
  sort(v + 1, v + n + 1);

  int ans = 0;
  for(int i = 1; i <= n; i++) {
    if((s | v[i]) > s) {
      ans++;
    }
    s = (s | v[i]);
  }

  cout << ans;
  return 0;
}