#include <ctime>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
using namespace std;

typedef long long ll;
typedef double lf;
typedef long double Lf;
typedef pair <int,int> pii;
typedef pair <ll, ll> pll;

#define TRACE(x) cerr << #x << "  " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define _ << " " <<

#define fi first
#define sec second
#define mp make_pair

const int MAXN = (1 << 19) + 100;

int n, bio[30], p[MAXN];


int main() {
	scanf("%d",&n);
	REP(i, n) scanf("%d",&p[i]);
	sort(p, p + n);


	REP(i, n) REP(j, 20) if (!bio[j] && ((1 << j) & p[i])) bio[j] = i + 1;

	int sol = 0;
	REP(i, n) {
		bool ok = 0;
		REP(j, 20) if (bio[j] == i + 1) ok = 1;
		sol += ok;
	}

	printf("%d\n",sol);
	return 0;
}