#include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <complex>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<62;
const double pi=acos(-1);
const double eps=1e-7;
const ll mod=1e9+7;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

int n;
set<P> st;

int main(){
	cin>>n;
	st.insert({0,1});
	for(int i=0;i<n;i++){
		int x;
		cin>>x;
		auto it=st.lower_bound({x,inf});
		if(it==st.begin()){
			cout<<"No"<<endl;
			continue;
		}
		it--;
		int l=it->first,r=it->second;
		st.erase(it);
		if(l<=x&&x<r){
			if(l!=x) st.insert({l,x});
			if(x+1!=r) st.insert({x+1,r});
		}
		else{
			if(l!=r-1) st.insert({l,r-1});
			st.insert({r,x+1});
		}
		cout<<"Yes"<<endl;
	}
}
### Prompt

Please provide a CPP coded solution to the problem described below:

Example

Input

6
2
3
1
1
4
2


Output

Yes
Yes
Yes
No
Yes
No

### Response

```cpp
#include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <complex>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<62;
const double pi=acos(-1);
const double eps=1e-7;
const ll mod=1e9+7;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

int n;
set<P> st;

int main(){
	cin>>n;
	st.insert({0,1});
	for(int i=0;i<n;i++){
		int x;
		cin>>x;
		auto it=st.lower_bound({x,inf});
		if(it==st.begin()){
			cout<<"No"<<endl;
			continue;
		}
		it--;
		int l=it->first,r=it->second;
		st.erase(it);
		if(l<=x&&x<r){
			if(l!=x) st.insert({l,x});
			if(x+1!=r) st.insert({x+1,r});
		}
		else{
			if(l!=r-1) st.insert({l,r-1});
			st.insert({r,x+1});
		}
		cout<<"Yes"<<endl;
	}
}
```