#include <cstdio>
using namespace std;
int arb[800000],maxint,flex1,flex2;
int maxim(int a,int b)
{
    if (a>b)
        return a;
    return b;
}
void update(int nod,int left,int right)
{
    if (left==right)
    {
        arb[nod]=flex2;
        return;
    }
    int mid=left+(right-left)/2;
    if (mid>=flex1)
        update(nod*2,left,mid);
    else
        update(nod*2+1,mid+1,right);
    arb[nod]=maxim(arb[nod*2],arb[nod*2+1]);
}
void query(int nod,int left,int right)
{
    if ((left>=flex1)&&(right<=flex2))
    {
        if (maxint<arb[nod])
            maxint=arb[nod];
        return;
    }
    int mid=left+(right-left)/2;
    if (mid<flex2)
        query(nod*2+1,mid+1,right);
    if (mid>=flex1)
        query(nod*2,left,mid);
}
int main()
{
    freopen("permsort.in","w",stdin);
    freopen("permsort.out","w",stdout);
    fclose(stdin);
    fclose(stdout);
    return 0;
}