Presents

最新推荐文章于 2020-01-08 19:25:16 发布

原创最新推荐文章于 2020-01-08 19:25:16 发布 · 460 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#acm #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 pi. 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.

Input

The first line contains one integer n (1 ≤ n ≤ 100) — the quantity of friends Petya invited to the party. The second line contains nspace-separated integers: the i-th number is pi — the number of a friend who gave a gift to friend number i. It is guaranteed that each friend received exactly one gift. It is possible that some friends do not share Petya's ideas of giving gifts to somebody else. Those friends gave the gifts to themselves.

Output

Print n space-separated integers: the i-th number should equal the number of the friend who gave a gift to friend number i.

Examples

input
4
2 3 4 1

output
4 1 2 3

input
3
1 3 2

output
1 3 2

input
2
1 2

output
1 2

Print n space-separated integers: the i-th number should equal the number of the friend who gave a gift to friend number i.

#include <stdio.h>
#define N 100
int main()
{
	int n,a[N],i,j;
	scanf ("%d",&n);
	for (i=1;i<=n;i++)
	{
		scanf ("%d",&a[i]);
	}
	for (i=1;i<=n;i++)
	{
		for (j=1;j<=n;j++)
		{
			if (a[j]==i) 
			{
				printf ("%d ",j);
			}
		 } 
	}
 }