A – Presents

Problem description

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 invitedn 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 from1 ton. Petya remembered that a friend numberi gave a gift to a friend numberpi. He also remembered that each of his friends received exactly one gift.

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

Input

The first line contains one integern (1 ≤ n ≤ 100) — the quantity of friends Petya invited to the party. The second line containsn space-separated integers: thei-th number ispi— the number of a friend who gave a gift to friend numberi. 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

Printn space-separated integers: thei-th number should equal the number of the friend who gave a gift to friend numberi.

Examples

Input

42 3 4 1

Output

4 1 2 3

Input

31 3 2

Output

1 3 2

Input

21 2

Output

1 2解题思路:输入n(n表示编号从1到n的学生总数)个数,第i个数表示编号为i的学生送礼物给编号为j的学生,要求输出编号为j的学生收到那个送他礼物的学生编号i,水过!AC代码:
1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int main(){
 4     int n,x,t[105];
 5     cin>>n;
 6     for(int i=1;i<=n;++i){cin>>x;t[x]=i;}
 7     for(int i=1;i<=n;++i)
 8         cout<<t[i]<<(i==n?"\n":" ");
 9     return 0;
10 }

原文链接: https://www.cnblogs.com/acgoto/p/9149986.html

欢迎关注

微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍

原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/275508

非原创文章文中已经注明原地址,如有侵权,联系删除

关注公众号【高性能架构探索】,第一时间获取最新文章

转载文章受原作者版权保护。转载请注明原作者出处!

(0)
上一篇 2023年2月15日 上午1:04
下一篇 2023年2月15日 上午1:05

相关推荐