#include<stdio.h>
#include<algorithm>

const int N = 100001;

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


//ultima speta de problema

int query(int p){
    int s=0;
    while(p!=0){
        s+=aib[p];
        p-=p&(-p);
    }
    return s;
}

void update(int p,int val){

    while(p<=n){
        aib[p]  =   val;
        p+=p&(-p);
        }
}


int main(){

    int n,i;

    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);

    scanf("%d",&n);

    for(i=1;i<=n;i++){

        scanf("%d",&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;
        }
    }

    return 0;