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

int main(){
  using mint=atcoder::modint998244353;
  int log=20;
  int n;
  cin>>n;
  vector<int> a(n);
  mint ans=0;
  vector<mint> cnt(log),sum(log);
  for (int i=0;i<n;i++){
    cin>>a[i];
    ans+=mint(a[i])*(mint(i)*n+mint(n)*(n-1)/2);
    for (int j=0;j<log;j++) if (i>>j&1) cnt[j]++,sum[j]+=a[i];
  }
  for (int i=0;i<log;i++) ans-=cnt[i]*(1<<i)*sum[i]*2;
  cout<<ans.val()<<endl;
}