#include <iostream>
#include <vector>
#include <cmath>

using namespace std;
typedef long long int64;
const int kMod = 1e9+7;

int form[1<<19], v[1<<19];

void solve() {
	int n;
	cin >> n;

	for (int i = 1; i <= n; ++i) {
		int x;
		cin >> x;
		v[x] = 1;
	}

	int ans = 0;
	for (int i = 0; i < (1<<19); ++i) {
		for (int j = 0; j < 20; ++j) {
            if(((i>>j)&1)) {
                form[i] |= (form[i^(1<<j)]);
            }
        }
        if (v[i] == 1 && form[i] != i) {
        	++ans;
        	form[i] = i;
        }
	}

	cout << ans << "\n";
}

int main() {
	int test = 1;

	for (;test; --test) {
		solve();
	}
}