#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937_64 rng(random_device{}());
int random(int l,int r) {
    return rng()%(r - l + 1) + l;
}
signed main() {
    ios::sync_with_stdio(0),cin.tie(0);
    auto solve = [&]() {
        int n;
        cin >> n;
        vector <vector <int>> v(n + 1);
        vector <int> a(n + 1);
        unordered_set <int> st;
        for(int i=1;i<=n;i++) {
            cin >> a[i];
        }
        for(int i=1;i<n;i++) {
            v[i].push_back(a[i]);
            v[i].push_back(a[i+1]);
        }
        for(int i=1;i<n;i++) {
            unordered_map<int,int> mp;
            for(auto x : v[i]) {
                mp[x] ++ ;
            }
            for(int j=1;j<=2000;j++) {
                int p = random(0,v[i].size()-2);
                int op = random(1,3);
                if(op==1) {
                    int val = (v[i][p]&v[i][p+1]);
                    if(!mp.count(val)) {
                        v[i].insert(v[i].begin() + p,val);
                        mp[val] ++ ;
                    }
                }
                else if(op==2) {
                    int val = (v[i][p]|v[i][p+1]);
                    if(!mp.count(val)) {
                        v[i].insert(v[i].begin() + p,val);
                        mp[val] ++ ;
                    }
                }
                else {
                    int val = (v[i][p]^v[i][p+1]);
                    if(!mp.count(val)) {
                        v[i].insert(v[i].begin() + p,val);
                        mp[val] ++ ;
                    }
                }
            }
        }
        for(int i=1;i<=n;i++) {
            for(auto x : v[i]) {
                // cout << x << " ";
                st.insert(x);
            }
        }
        cout << st.size() << "\n";
    };
    int t=1;
    // cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}