#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<int, mint>> dp{{0, 1}};
  rep(i, n) {
    int x;
    cin >> x;
    vector<pair<int, mint>> ndp;
    ndp.emplace_back(x, 0);
    for(auto [pre, v]: dp) {
      ndp.emplace_back(pre | x, v);
    }
    int sz = ndp.size();
    rep(i, sz - 1) if (ndp[i].first == ndp[i+1].first) ndp[i+1].second += ndp[i].second;
    rrep(i, sz - 1) if (ndp[i].first == ndp[i+1].first) ndp[i] = ndp[i+1];
    ndp.erase(unique(all(ndp)), ndp.end());
    sz = ndp.size();
    rrep(i, sz - 1) ndp[i].second += ndp[i + 1].second;
    swap(dp, ndp);
  }
  mint ans;
  for(auto [_, v]: dp) ans += v;
  cout << ans.val() << '\n';
}