In what concerns the continuous evaluation solving exercises grade during the semester, you should submit until 23:59 of December 7th
(this exercise will still be available for submission after that deadline, but without couting towards your grade)
[to understand the context of this problem, you should read the class #08 exercise sheet]

[AED042] Life Moments

Arthur Dent already knows that 42 is the answer to the ultimate question of life, the universe, and everything, but he just can't stop thinking about the meaning of life. In his quest for self-discovery, he has started to keep track of significant life moments. He records these moments in a sequence, one after another, as he goes through his day. However, Arthur is a bit forgetful, and he frequently wonders if something similar has already happened to him before....

For each new event in his day, Arthur tries to recall the most recent time he experienced something similar. If he remembers a previous, similar event, he notes the position of that memory. If not, he just writes down -1.

The Problem

Given a sequence of Arthur's life events (given as integer identifiers), find out where each event has last occurred before, if at all. For each event in the sequence, record the most recent previous occurrence of that exact event. If it’s the first time Arthur has experienced it, mark it as -1.

Input

The first line of the input contains an integer N, the number of events Arthur has recorded. The second line contains N integers A₁, A₂, ..., A_N, representing the sequence of Arthur's life events. Each number represents a unique kind of event.

Output

The output should consist of one line with a sequence of integers B, where each element B_i represents the last position where the event A_i previously appeared in Arthur’s day. If it’s the first occurrence, print -1 for that position. There should be a single space between elements, but no extra spaces at the start or end of the line.

The first example includes a detailed explanation of the output.

Constraints

The following limits are guaranteed in all the test cases that will be given to your program:

5
1 2 1 1 3

-1 -1 1 3 -1

Explanation of Example Input 1:

• i = 1: There is no 1 before A₁ = 1, so B₁ = -1.
• i = 2: There is no 2 before A₂ = 2, so B₂ = -1.
• i = 3: The most recent occurrence of 1 before A₃ = 1 is A₁, so B₃ = 1.
• i = 4: The most recent occurrence of 1 before A₄ = 1 is A₃, so B₄ = 3.
• i = 5: There is no 3 before A₅ = 3, so B₅ = -1.

4
1 1000000000 1000000000 1

-1 -1 2 1