#include"bits/stdc++.h"
using namespace std;
#define L long long

L MOD = 998244353;

void solve(vector<L>&nums, vector<L>&dp) {
  int n = nums.size();
  vector<vector<L>> andR(n);
  for (int i = 0; i < n; i++) {
    andR[i].push_back(nums[i]);
    int j = 0;
    int p = 1;
    while (i-2*p+1 >= 0) {
      andR[i].push_back(andR[i][j] & andR[i-p][j]);
      j++;
      p <<= 1;
    }
  }
  dp.assign(n, 0);
  dp[0] = 1;
  vector<L> dpp(n+2, 0);
  dp[0] = dpp[1] = 1;
  dpp[2] = 2;
  for (int i = 1; i < n; i++) {
    L curr = nums[i];
    int p = i;
    int j = andR[i].size()-1;
    while (j >= 0 && p > 0) {
      if (curr & andR[p-1][j]) {
        curr &= andR[p-1][j];
        p -= (1 << j);
        j = min(j, (int)andR[p].size());
      }
      j--;
    }
    dp[i] = (dpp[i+1] - dpp[p] + MOD) % MOD;
    dpp[i+2] = (dp[i] + dpp[i+1]) % MOD;
  }
}

// g++ -std=c++17 -O2 -DLOCAL -o a a.cpp
int main() {
  int n;
  cin >> n;
  vector<L> nums(n,0);
  L all = -1;
  for (int i = 0; i < n; i++) {
    cin >> nums[i];
    all &= nums[i];
  }
  vector<L> dp;
  solve(nums, dp);
  L res = dp[n-1];
  if (all) {
    cout << ((2 * res) % MOD - n + MOD) % MOD << '\n';
    return 0;
  }
  while (nums.size()>2&&nums[0]) {
    while (nums.size()>2 && (nums.back()&nums[0])==nums[0]) {
      nums.pop_back();
      n--;
      res = (res + dp[n-2]) % MOD;
    }
    if (nums.size()) {
      nums[0] = nums[0]&nums.back();
      nums.pop_back();
      n--;
      solve(nums, dp);
      res = (res + dp[n-1]) % MOD;
    }
  }
  cout << res << "\n";
}