GukiZ and Contest

2000ms

262144K

Description:

Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.

In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote the rating of i-th student as a_i. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings.

He thinks that each student will take place equal to $\text{[math]}$ . In particular, if student A has rating strictly lower then student B, A will get the strictly better position than B, and if two students have equal ratings, they will share the same position.

GukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.

Input:

The first line contains integer n (1 ≤ n ≤ 2000), number of GukiZ's students.

The second line contains n numbers a₁, a₂, ... a_n (1 ≤ a_i ≤ 2000) where a_i is the rating of i-th student (1 ≤ i ≤ n).

Output:

In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.

Sample Input:

3
1 3 3

Sample Output:

3 1 1

Sample Input:

1
1

Sample Output:

Sample Input:

5
3 5 3 4 5

Sample Output:

4 1 4 3 1

Note:

In the first sample, students 2 and 3 are positioned first (there is no other student with higher rating), and student 1 is positioned third since there are two students with higher rating.

In the second sample, first student is the only one on the contest.

In the third sample, students 2 and 5 share the first position with highest rating, student 4 is next with third position, and students 1 and 3 are the last sharing fourth position.

Informação

Provedor Codeforces

Código CF551A