BIT class

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

#define P pair < int, int >
#define s second
#define f first
#define pb push_back
#define all(v)  v.begin(), v.end()
#define rep(i,a,n)  for(int i = a; i <= n; ++i)
#define lb(v, x)  lower_bound(all(v), x) - v.begin()
#define up(v, x)  upper_bound(all(v), x) - v.begin()
#define fo(i, n)   for (int i = 1; i <= n; ++i)

const int N = 1e6 + 5;
int a[N];
class bit{
		int bit[N];
		public:
		void add(int i, int val) {
			for( ; i < N; i += (i & -1))
				bit[i] += val;
		}
		int query(int i) {
			int ans(0);
			for(; i; i -= i & -i)
				ans += bit[i];
			return ans;
		}
};
int main(){
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
    bit obj;
   	int n, q, l, r, k;
   	cin >> n;
   	fo(i, n)
   		cin >> a[i];








    return 0;
}