#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void)
{
    int N;
    cin>> N;
    vector<int> a(N);
    rep(i, N) cin >> a[i];
    vector<int> odd;
    vector<int> even;
    rep(i, N){
        if(__builtin_popcount(a[i]) % 2) odd.push_back(a[i]);
        else even.push_back(a[i]);
    }
    int n = size(odd);
    int m = size(even);
    mf_graph<int> G(N + 2);

    rep(i, n) G.add_edge(0, i + 1, 1);
    rep(i, m) G.add_edge(n + i + 1, N + 1, 1);

    rep(i, n){
        rep(j, m){
            if(__builtin_popcount(odd[i] ^ even[j]) == 1) G.add_edge(i + 1, n + j + 1, 1);
        }
    }
    cout << N - G.flow(0, N + 1) << endl;
    return 0;
}