#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int popcount(long long n) {
	n = (n & 0x5555555555555555) + (n >> 1 & 0x5555555555555555);
	n = (n & 0x3333333333333333) + (n >> 2 & 0x3333333333333333);
	n = (n & 0x0f0f0f0f0f0f0f0f) + (n >> 4 & 0x0f0f0f0f0f0f0f0f);
	n = (n & 0x00ff00ff00ff00ff) + (n >> 8 & 0x00ff00ff00ff00ff);
	n = (n & 0x0000ffff0000ffff) + (n >> 16 & 0x0000ffff0000ffff);
	n = (n & 0x00000000ffffffff) + (n >> 32 & 0x00000000ffffffff);
	return n;
}
vector<int>to[2000];
vector<int>memo;
P dfs(int v, int d = 0, int p = -1) {
	P ret = { 0,0 };
	if (0 == memo[v])ret.first++;
	else ret.second++;
	for (int e : to[v]) {
		if (p == e) continue;
		if (-1 != memo[e])continue;
		memo[e] = 1 - memo[v];
		auto get = dfs(e, d + 1, v);
		ret.first += get.first;
		ret.second += get.second;
	}
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n);
	rep(i, n)cin >> a[i];
	rep(i, n)rep2(j, i + 1, n) {
		int x = a[i] ^ a[j];
		if (1 == popcount(x)) {
			to[i].push_back(j);
			to[j].push_back(i);
		}
	}
	memo.resize(n, -1);
	int ans = 0;
	rep(i, n) {
		if (-1 != memo[i])continue;
		memo[i] = 0;
		auto get = dfs(i);
		ans += max(get.first, get.second);
	}
	cout << ans << endl;
	return 0;
}