#include<iostream> #include<string> #include<vector> #include<algorithm> #include<cmath> #include<stdio.h> #include<queue> #include <climits> #include <map> #include <set> const int mod = 1e9 + 7; const long long INF = 1LL << 60; using namespace std; typedef long long ll; int main() { int n; cin >> n; int k = 1; int ks; cin >> ks; cout << 1 << endl; for(int i = 0; i < n-1; i++){ int s; cin >> s; if(s > ks){ k++; cout << k << endl; }else{ cout << k << endl; } } }