#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream cin ("inv.in");
ofstream cout("inv.out");
const int N = 100009;
int ans,n;
vector<int> aib,a,b,poz;
int cb(int val)
{
    int st = 0,dr = n-1,poz;
    while(st<=dr)
    {
        int mij = (st+dr)>>1;
        if(b[mij] >= val)
        {
            poz = mij;
            dr = mij-1;
        }
        else
            st = mij+1;
    }
    return poz;
}
void update(int x, int val)
{
    for(int i=x;i<=n;i+=i&-i)
        aib[i] += val;
}
int query(int x)
{
    int sum = 0;
    for(int i=x; i ; i-=i&-i)
        sum += aib[i];
    return sum;
}
int main()
{
    int x;
    cin>>n;
    aib = vector<int>(n+1);
    a = b = poz = vector<int>(n);
    for(int i=0;i<n;++i)
        cin>>a[i];
    b = a;
    return 0;
}