#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'
using lint=long long;
#define all(n) (n).begin(),(n).end()

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<vector<int>>s(n+1);
    s[0].emplace_back(0);
    for(int i=0;i<n;++i){
        for(auto e:s[i]){
            s[i+1].emplace_back(e|a[i]);
        }
        s[i+1].emplace_back(a[i]);
        s[i+1].emplace_back(0);
        sort(all(s[i+1]));
        s[i+1].erase(unique(all(s[i+1])),s[i+1].end());
    }
    mint ans=0;
    vector<pair<lint,lint>>g;
    for(int i=0;i<n;++i){
        for(auto d:s[i]){
            for(auto e:s[i]){
                if(d<e)break;
                if((d|e)==d){
                    g.emplace_back((lint(i)<<31)+d,(lint(i+1)<<31)+(e|a[i]));
                }
            }
        }
    }
    sort(all(g));
    g.erase(unique(all(g)),g.end());
    map<lint,mint>dp;
    dp[0]=1;
    for(auto [s,t]:g){
        dp[t]+=dp[s];
        if((t>>31)==n){
            ans+=dp[s];
        }
    }
    cout<<ans.val()<<endl;
}