/*

Author: Haze

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll readL() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

inline int read() {
    return (int) (readL());
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

void solve() {
    int n = read();
    vector<int>a(n), num;
    irep(i, 0, n - 1)a[i] = read();
    num = a;
    irep(i, 0, n - 2){
        int x = a[i], y = a[i + 1];
        num.push_back(x ^ y);
        num.push_back(x & y);
        num.push_back(x | y);
        num.push_back(x & (x ^ y));
        num.push_back(y & (x ^ y));
    }
    sort(begin(num), end(num));
    num.erase(unique(begin(num), end(num)), end(num));
    cout << num.size();
}

int main() {
    // IOS
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}