sum-of-bitwise-and-of-all-subarrays

#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define ld long double
#define pb push_back
#define fe first
#define se second
#define st(x) sort(x.begin(),x.end())
#define rst(x) sort(x.rbegin(), x.rend())
#define all(x) x.begin(),x.end()
long double pi = 3.14159265358979323;

const double EPS = 1e-12;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;




int main()
{
    fast;
    ll n;
    cin >> n ;
    ll id[60] = {};
    ll val ;
    ll ans = 0 ;
    for(int i = 1 ;  i <= n ;i++ )
    {
        cin >> val;
        for(int j = 0 ; j < 60 ; j++ )
        {
            ll num = 1LL << j;
            if(num & val)
            {
                ans += (ll)pow(2,j)*i;
                id[j] = i ;
            }
            else if(id[j])
            {
                ans += (ll)pow(2,j)*id[j];
            }
        }
    }
    cout << ans;

    //time complexity O(n*60);
    //space complexity O(60);
























    return 0;

}