#include <bits/extc++.h>
using namespace std;


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

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

    __gnu_pbds::gp_hash_table<int, bool> s;
    for (int i = 1; i <= n; i++) {
        s.insert({a[i], 1});
    }
    auto get = [&](int x, int y) {
        auto dfs = [&](auto &dfs, int cnt, int v) -> void {
            s.insert({v, 1});
            if (cnt == 3) return;
            dfs(dfs, cnt + 1, v & y);
            dfs(dfs, cnt + 1, v | y);
            dfs(dfs, cnt + 1, v ^ y);
        };
        dfs(dfs, 0, x);
    };

    for (int i = 1; i < n; i++) {
        get(a[i], a[i + 1]);
        get(a[i + 1], a[i]);
    }

    cout << s.size() << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

/*
4
>>->>>
>>>->
>>>>>
>->>>>>>
*/