#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(void) {
    int N;
    cin >> N;
    int rank[N];
    ll a;
    ll b;
    cin >> a;
    rank[0] = 1;
    for (int i=1; i<N; i++) {
        cin >> b;
        if (a < b) rank[i] = rank[i-1] + 1;
        else rank[i] = rank[i-1];
    }
    for (int i=0; i<N; i++) {
        cout << rank[i] << endl;
    }
    return 0;
}