#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(int argc, char *argv[])
{
	int n, k, a[100000];
	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
		a[i] = -a[i];
	}
	k = a[0];
	for (int i = 0; i < n; ++i) {
		sort(a, a + i + 1);
		int ans = find(a, a + i + 1, k) - a + 1;
		cout << ans << endl;
	}
	return 0;
}