#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010


int main(){
  int n,k;
  int a,ans = 1;
  
  scanf("%d%d",&n,&k);

  printf("1\n");
  
  for(int i=0;i<n-1;i++){
    scanf("%d",&a);
    if(a > k) ans++;
    printf("%d\n",ans);
  }
  
  return 0;
}