#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long int lint;
int main() {
	int N, a0;
	cin >> N >> a0;
	vector<int>vec(N - 1);
	for (int ia = 0; ia < N - 1; ia++) {
		cin >> vec.at(ia);
	}
	int cnt = 1;
	cout << cnt << endl;
	for (int ib = 0; ib < N - 1; ib++) {
		if (a0 < vec.at(ib)) {
			cnt++;
		}
		cout << cnt << endl;
	}
}