#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)

constexpr int D = 30;

constexpr int md = (119 << 23) + 1;

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false);
    int N;
    cin >> N;

    vector<int> prvs(D + 1, 0), js;

    unordered_map<int, int> dp, dpnxt;
    dp[0] = 1;

    for (int i = 1; i <= N; ++i) {
        int a;
        cin >> a;
        REP(d, D) {
            if ((a >> d) & 1) prvs.at(d) = i;
        }
        prvs.back() = i;
        dpnxt.clear();
        // unordered_map<int, int> dpnxt;

        for (int j : prvs) {
            if (j <= 0) continue;
            long long sum = 0;
            for (auto [jprv, cnt] : dp) {
                if (jprv <= j) sum += cnt;
            }
            dpnxt[j] = sum % md;
        }
        swap(dp, dpnxt);
        // dp = dpnxt;
    }
    long long ret = 0;
    for (auto [k, v] : dp) ret += v;
    cout << ret % md << endl;
}