# coding: utf-8
import array, bisect, collections, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7
 
 
def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}
 
 
def solve(N, a):
    ans = [1]
    under = 1
    k_num = a[0]
    for i in range(1, N):
        if a[i] > k_num:
            under += 1
        ans.append(under)

    return ans
 
def main():
    N = II()
    a = []
    for __ in range(N):
        a.append(II())

    ans = solve(N, a)
    for i in ans:
        print(i)
 
 
if __name__ == "__main__":
    main()