#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N;
	cin >> N;
	vi v(N);
	vin(v);

	lint a=0, b=0, c=0, x, y, z;
	mf_graph<int> g(N+2);
	vi o, e;
	rep(i, N) {
		if (__builtin_popcount(v[i])%2) o.pb(v[i]);
		else e.pb(v[i]);
	}
	if (o.size() == 0 || e.size() == 0) drop(N);
	rep(i, o.size()) {
		rep(j, e.size()) {
			x = o[i]^e[j];
			if (__builtin_popcount(x) == 1) g.add_edge(i, o.size()+j, 1);
			else g.add_edge(i, o.size()+j, 0);
		}
	}
	rep(i, o.size()) g.add_edge(N, i, 1);
	rep(i, e.size()) g.add_edge(o.size()+i, N+1, 1);
	std::cout << N-g.flow(N, N+1) << '\n';
}