#include<bits/stdc++.h> using namespace std; long long n,a[100010],b[100010]; int f(int z){ int l=1; int r=n,mid; while(l<=r){ mid=l+r>>1; if(z>=a[mid]) l=mid+1; else r=mid-1; } if(a[r]==z) return r; else return -1; } int main(){ scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); b[i]=a[i]; } sort(a+1,a+n+1); for(int i=1;i<=n;i++){ printf("%d\n",n-f(b[i])+1); } return 0; }