#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define trav(a, x) for(auto& a : x)
#define FOR(i, a, b) for (int i=(a); i<=(signed)(b); i++)
#define ROF(i, a, b) for (int i=(a); i>=(signed)(b); i--)
#define F0R(i, a) for (int i=0; i<(signed)(a); i++)
#define vi vector<int>
#define f first
#define s second
#define all(v) (v).begin(), (v).end()
typedef long long ll;
using P = pair<int, int>;

const ll mod = 998244353;

template <typename T>
struct sparse_table{
    vector<vector<T>> ST1;
    sparse_table(vector<T> &A){
        int N = A.size();
        int LOG = 32 - __builtin_clz(N);
        ST1 = vector<vector<T>>(LOG, vector<T>(N));
        for (int i = 0; i < N; i++){
            ST1[0][i] = A[i];
        }
        for (int i = 0; i < LOG - 1; i++){
            for (int j = 0; j < N - (1 << i); j++){
                ST1[i + 1][j] = (ST1[i][j] & ST1[i][j + (1 << i)]);
            }
        }
    }
    T range_and(int L, int R){
        int d = 31 - __builtin_clz(R - L);
        return ST1[d][L] & ST1[d][R - (1 << d)];
    }
};

struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}

int main() 
{	
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    vector<ll> a(n);
    ll sm = ~0LL;
    F0R(i, n) {cin >> a[i]; sm&=a[i];}
    mint res;
    bool first = true;
    int i = n-1;
    while(i>=0) {
        vector<ll> curr;
        F0R(j, i+1) curr.push_back(a[j]);
        sparse_table<ll> ST(curr);
        vector<mint> dp(i+2);
        dp[0]=1;
        F0R(l, i+1) {
            int lo = -1, hi = l;
            while(hi-lo>1) {
                int mid = (hi+lo)/2;
                if(ST.range_and(mid, l+1)) hi = mid;
                else lo = mid;
            }
            dp[l+1] = dp[l]-(lo>=0?dp[lo]:mint(0)) + dp[l];
        }
        res += dp[i+1]-dp[i];
        while(i > 0 && (a[i]&a[0])==a[0]) {i--; res += dp[i+1]-dp[i];}
        if(i) {
            a[0] = (a[0]&a[i]);
        }
        i--;    

        if(a[0]==0) break;
    }
    //cout << res << "\n";
    if(sm) res -= (n-1);
    cout << res << "\n"; 
    return 0;
}