#include<bits/stdc++.h>
using namespace std;
 
int binSearch(int A[],int low,int high,int key){
 
	if(low>high) return -1;
	int mid=(high+low)/2;
	if(A[mid]==key) return mid;
	if(key<A[mid]) return binSearch(A,low,mid-1,key);
	return binSearch(A,mid+1,high,key);
}
int main(){
 
	int t,n,i=0,j=0,ranK=0,curr=0;
	scanf("%d",&t);
	int *arr=(int*)malloc(t*sizeof(int));
	while(t--){
 
		scanf("%d",&curr);
		arr[i]=curr;
		i++;
		sort(arr,arr+i);
 	   printf("%d\n",i-binSearch(arr,0,i-1,curr));
	}
	return 0;
}

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBiaW5TZWFyY2goaW50IEFbXSxpbnQgbG93LGludCBoaWdoLGludCBrZXkpewoKCWlmKGxvdz5oaWdoKSByZXR1cm4gLTE7CglpbnQgbWlkPShoaWdoK2xvdykvMjsKCWlmKEFbbWlkXT09a2V5KSByZXR1cm4gbWlkOwoJaWYoa2V5PEFbbWlkXSkgcmV0dXJuIGJpblNlYXJjaChBLGxvdyxtaWQtMSxrZXkpOwoJcmV0dXJuIGJpblNlYXJjaChBLG1pZCsxLGhpZ2gsa2V5KTsKfQppbnQgbWFpbigpewoKCWludCB0LG4saT0wLGo9MCxyYW5LPTAsY3Vycj0wOwoJc2NhbmYoIiVkIiwmdCk7CglpbnQgKmFycj0oaW50KiltYWxsb2ModCpzaXplb2YoaW50KSk7Cgl3aGlsZSh0LS0pewoKCQlzY2FuZigiJWQiLCZjdXJyKTsKCQlhcnJbaV09Y3VycjsKCQlpKys7CgkJc29ydChhcnIsYXJyK2kpOwogCSAgIHByaW50ZigiJWRcbiIsaS1iaW5TZWFyY2goYXJyLDAsaS0xLGN1cnIpKTsKCX0KCXJldHVybiAwOwp9

Ngo3OAoyNAo2OAo0MAozOQo4OQo=

6
78
24
68
40
39
89