#pragma optimize("Ofast")
#pragma target("avx2")
#include<bits/stdc++.h>
using namespace std;
#include<atcoder/modint.hpp>
using mint=atcoder::static_modint<998244353>;
#define endl '\n'

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin>>n;
    vector<int>a(n);
    for(int i=0;i<n;++i)cin>>a[i];
    vector<set<int>>ss(n+1);
    vector<vector<int>>s(n+1);
    vector<map<int,mint>>dp(n+1);
    ss[0].emplace(0);
    for(int i=0;i<n;++i){
        for(auto e:ss[i]){
            ss[i+1].emplace(e|a[i]);
        }
        ss[i+1].emplace(a[i]);
        ss[i+1].emplace(0);
    }
    for(int i=0;i<n;++i)s[i]=vector(ss[i].begin(),ss[i].end());
    ss=vector<set<int>>();
    mint ans=0;
    dp[0][0]=1;
    for(int i=0;i<n;++i){
        for(auto [d,c]:dp[i]){
            unordered_set<long long>used;
            for(auto e:s[i]){
                if(d<e)break;
                if(used.count(d*(1LL<<31)+(e|a[i])))continue;
                if((d|e)==d){
                    dp[i+1][e|a[i]]+=c;
                    used.emplace(d*(1LL<<31)+(e|a[i]));
                }
            }
        }
    }
    for(auto [e,c]:dp[n])ans+=c;
    cout<<ans.val()<<endl;
}