#include <fstream>
#include <algorithm>

using namespace std;

ifstream in("scmax.in");
ofstream out("scmax.out");

const int N = 100001;

int v[N], w[N], x[N], n, i, aib[N];

bool cmp(int p1, int p2){
    return v[p1] < v[p2];
}

void update(int poz, int val){
    while(p <= n){
        aib[p] += val;
        p += p&(-p);
    }
}

int query(){

}

int main()
{
    in >> n;
    for(i = 1; i <= n; i++){
        in >> v[i];
        w[i] = i;
    }
    sort(w+1, w+n+1, cmp);
    for(i = 1; i <= n; i++){
        if(i > 1 && v[w[i]] == v[w[i-1]]){
            x[w[i]] = x[w[i-1]];
        } else {
            x[w[i]] = i;
        }
    }
    /*for(i = 1; i <= n; i++){
        out << x[i] << " ";
    }*/
    return 0;
}