#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

#include <atcoder/maxflow>
void run_case() {
    int N;
    cin >> N;
    vector<int> A(N);
    rep(i, N) cin >> A[i];
    vector<int> color(N, -1);
    {
        vector<vector<int>> G(N);
        rep(i, N) rep(j, i + 1, N) {
            int t = A[i] ^ A[j];
            if ((t & -t) == t) {
                G[i].pb(j);
                G[j].pb(i);
            }
        }
        for (int i = 0; i < N; i++)
            if (color[i] == -1) {
                color[i] = 0;
                y_combinator([&](auto self, int v) -> void {
                    for (int u : G[v])
                        if (color[u] == -1) {
                            color[u] = 1 - color[v];
                            self(u);
                        }
                })(i);
            }
    }
    atcoder::mf_graph<ll> G(N + 2);
    rep(i, N) {
        if (color[i] == 0) G.add_edge(N, i, 1);
        else if (color[i] == 1) G.add_edge(i, N + 1, 1);
        else assert(0);
    }
    rep(i, N) rep(j, i + 1, N) {
        int t = A[i] ^ A[j];
        if ((t & -t) == t) {
            if (color[i] == 0) G.add_edge(i, j, 1);
            else G.add_edge(j, i, 1);
        }
    }
    int M = G.flow(N, N + 1);
    cout << N - M << "\n";
}
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    while (T--) run_case();
    return 0;
}