Presents

Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited n his friends there.

If there's one thing Petya likes more that receiving gifts, that's watching others giving gifts to somebody else. Thus, he safely hid the laptop until the next New Year and made up his mind to watch his friends exchanging gifts while he does not participate in the process. He numbered all his friends with integers from 1 to n. Petya remembered that a friend number i gave a gift to a friend number p_i. He also remembered that each of his friends received exactly one gift.

Now Petya wants to know for each friend i the number of a friend who has given him a gift.

Example

Input

4

2 3 4 1

3

1 3 2

2

1 2

1 2

Output

4 1 2 3

1 3 2

1 2

此题是输入n位数字，再将它们从小到大排序，输出排序后数字原来的位置。

上代码《c》

#include<stdio.h>
int main()
{
int num,i,j,d,a[200],b[200],c=0;
while(~scanf("%d",&num))
{
c=0;
for(i=0;i<num;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<num;i++)
{
d=a[i];
b[i]=i+1;
for(j=0;j<num;j++)
{
if(d>a[j])
{
b[i]=j+1;
d=a[j];
c++;
}
}
if(c!=0)
a[b[i]-1]=101;
else
a[i]=101;
c=0;
     }

b[i]='\0';
for(i=0;i<num;i++)
{
printf("%d",b[i]);
if(b[i+1]!='\0')
{
printf(" ");
}
}
printf("\n");
}
return 0;
}