/*#include<stdio.h>
int arra[50001],aray[50001];
void qs(int s, int e)
{
int p=s,temp,l=s,h=e+1;
do
{
do{ l++;}while(aray[p]>aray[l]);
do{ h--;}while(aray[p]<aray[h]);
if(l<h)
{
temp=aray[l];
aray[l]=aray[h];
aray[h]=temp;
}
}while(l<h);
temp=aray[p];
aray[p]=aray[h];
aray[h]=temp;
if(s<h-1)qs(s,h-1);
if(h+1<e)qs(h+1,e);
}
int bs(int s,int e,int k)
{
int mid = (s+e)/2;
if(aray[mid]==k) return mid;
else if(aray[mid]>k) bs(s,mid-1,k);
else if(aray[mid]<k) bs(mid+1,e,k);
}
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&arra[i]);
aray[i]=arra[i];
}
qs(0,n-1);
for(i=0;i<n;i++)
{
int find=bs(0,n-1,arra[i]);
printf("%d ",find);
}
}
*/
#include<stdio.h>
int main()
{
int n,i,arry;
scanf("%d",n )
}