#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<mint>dp={1};
    for(int i=0;i<n;++i){
        bitset<1024>g;
        int to=0;
        auto get=[&](const vector<int>&x,int i){
            return lower_bound(all(x),i)-x.begin();
        };
        for(int j=0;j<s[i].size();++j){
            for(int k=0;k<=j;++k){
                const int d=s[i][j],e=s[i][k];
                if(d<e)break;
                if((d|e)==d){
                    g[get(s[i+1],e|a[i])*32+j]=1;
                }
            }
        }
        vector<mint>dp2(s[i+1].size());
        for(auto j=g._Find_first();j<1024;j=g._Find_next(j)){
            dp2[j/32]+=dp[j%32];
            if(i+1==n)ans+=dp[j%32];
        }
        swap(dp,dp2);
    }
    cout<<ans.val()<<endl;
}