Codeforces Round #307 (Div. 2) A. GukiZ and Contest

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 ai. 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 . 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 a1, a2, ... an (1 ≤ ai ≤ 2000) where ai 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.

Examples

input

Copy

3
1 3 3

output

Copy

3 1 1

input

Copy

1
1

output

Copy

1

input

Copy

5
3 5 3 4 5

output

Copy

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 3are the last sharing fourth position.

题意：算出第a[i]个数字在序列中第几大

    思路: upper_bound的简单应用

#include <bits/stdc++.h>

using namespace std;
int a[2005];
int b[2005];
int main()
{
     int n;
     cin>>n;
     for(int i=0;i<n;i++)
        cin>>a[i],b[i]=a[i];
     sort(a,a+n);
     for(int i=0;i<n;i++){
        int pos=upper_bound(a,a+n,b[i])-a;//b[i]在a中最多排多少
        cout<<n-pos+1<<endl;
     }

}