#include <bits/stdc++.h>
using namespace std;

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N; cin >> N;
  int fz = 1;
  set<int> bs;
  REP(i,N){
	int x;
	cin >> x;
	if(x < fz-1)
	  cout << "No" << endl;
	else{
	  //cout <<x <<"->"<<fz << " " << SZ(bs)<<endl;
	  if(x == fz-1 && SZ(bs) > x){
		cout << "No" << endl;
		continue;
	  }
	  if(bs.count(0)){
		cout << "No" << endl;
		continue;
	  }
	  
	  cout << "Yes" << endl;
	  if(x == fz){
		bs.insert(fz);
		while(bs.count(fz)) ++fz;
	  }
	  else{
		int i;
		for(i=x;i>=0;--i){
		  if(bs.count(i)){
			bs.erase(i);
		  }
		  else
			break;
		}
		if(fz == i)
		  fz = i+1;
		else
		  fz = min(fz, i+1);
		bs.insert(i);
	  }
	}
  }

  return 0;
}
### Prompt

Your task is to create a Cpp solution to the following problem:

Example

Input

6
2
3
1
1
4
2


Output

Yes
Yes
Yes
No
Yes
No

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N; cin >> N;
  int fz = 1;
  set<int> bs;
  REP(i,N){
	int x;
	cin >> x;
	if(x < fz-1)
	  cout << "No" << endl;
	else{
	  //cout <<x <<"->"<<fz << " " << SZ(bs)<<endl;
	  if(x == fz-1 && SZ(bs) > x){
		cout << "No" << endl;
		continue;
	  }
	  if(bs.count(0)){
		cout << "No" << endl;
		continue;
	  }
	  
	  cout << "Yes" << endl;
	  if(x == fz){
		bs.insert(fz);
		while(bs.count(fz)) ++fz;
	  }
	  else{
		int i;
		for(i=x;i>=0;--i){
		  if(bs.count(i)){
			bs.erase(i);
		  }
		  else
			break;
		}
		if(fz == i)
		  fz = i+1;
		else
		  fz = min(fz, i+1);
		bs.insert(i);
	  }
	}
  }

  return 0;
}
```