#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>
#include <atcoder/segtree>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

mint op(mint x, mint y){
    return x+y;
}

mint e(){
    return mint(0);
}

using Seg = atcoder::segtree<mint, op, e>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    auto prev_pos = vec2d(n, 30, -1);
    for(int i = 0; i < n; i++) {
        if(i > 0) prev_pos[i] = prev_pos[i-1];
        for(int j = 0; j < 30; j++){
            if(a[i]&(1<<j)){
                prev_pos[i][j] = i;
            }
        }
    }
    Seg dp(n+1);
    dp.set(n, mint(1));
    for(int i = n-1; i >= 0; i--){
        set<int> st = {i};
        for(int j = 0; j < 30; j++){
            if(prev_pos[i][j] != -1) st.insert(prev_pos[i][j]);
        }
        for(int idx: st){
            mint x = dp.prod(idx, i+2);
            dp.set(idx, x);
        }
    }
    cout << dp.get(0) << endl;
}