#include <atcoder/modint.hpp>
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (ssize(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main() {
  int N;
  cin >> N;
  vl A(N);
  fore(i, A) cin >> i;
  vl cnt(30);
  rep(i, N) {
    rep(j, 30) { cnt[j] += (i >> j & 1); }
  }
  using mint = atcoder::modint998244353;
  vector<mint> p2(30);
  p2[0] = 1;
  rep(i, 1, 30) p2[i] = p2[i - 1] * 2;
  mint ans = 0;
  rep(i, N) {
    mint x = 0;
    rep(j, 30) {
      if (i >> j & 1) {
        x += p2[j] * (N - cnt[j]);
      } else {
        x += p2[j] * cnt[j];
      }
    }
    ans += x * A[i];
  }
  cout << ans.val() << '\n';
}