#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef double ld;
typedef complex<ld> Point;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second

void solve() {
	int n; cin >> n; vector<bool> ans(n, true);
	set<LP> st;
	int x; cin >> x; ans[0] = true;
	st.insert({ 1, x });
	rep(i, n-1) {
		/*auto itr2 = st.begin();
		while (itr2 != st.end()) {
			LP p = *itr2;
			cout << p.first << " " << p.second << endl;
			itr2++;
		}*/
		int x; cin >> x;
		LP p = { x,INF };
		st.insert(p);
		auto itr = st.find(p);
		if (itr == st.begin()) {
			st.erase(p);
			ans[i + 1] = false;
			continue;
		}
		itr--; st.erase(p);
		p = *itr;
		if (p.first + p.second - 1 >= x) {
			ll dif = x - p.first;
			P nexle = { p.first,dif };
			P nexri = { x + 1,p.first + p.second - x - 1 };
			st.erase(itr);
			if (nexle.second > 0)st.insert(nexle);
			if (nexri.second > 0)st.insert(nexri);
		}
		else {
			P nexle = { p.first,p.second - 1 };
			P nexri = { p.first + p.second,x+1 - p.first - p.second };
			st.erase(itr);
			if (nexle.second > 0)st.insert(nexle);
			if (nexri.second > 0)st.insert(nexri);
		}
	}
	rep(i, n) {
		if (ans[i]) {
			cout << "Yes" << endl;
		}
		else {
			cout << "No" << endl;
		}
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	solve();
	//stop
	return 0;
}


### Prompt

Please formulate 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<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef double ld;
typedef complex<ld> Point;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second

void solve() {
	int n; cin >> n; vector<bool> ans(n, true);
	set<LP> st;
	int x; cin >> x; ans[0] = true;
	st.insert({ 1, x });
	rep(i, n-1) {
		/*auto itr2 = st.begin();
		while (itr2 != st.end()) {
			LP p = *itr2;
			cout << p.first << " " << p.second << endl;
			itr2++;
		}*/
		int x; cin >> x;
		LP p = { x,INF };
		st.insert(p);
		auto itr = st.find(p);
		if (itr == st.begin()) {
			st.erase(p);
			ans[i + 1] = false;
			continue;
		}
		itr--; st.erase(p);
		p = *itr;
		if (p.first + p.second - 1 >= x) {
			ll dif = x - p.first;
			P nexle = { p.first,dif };
			P nexri = { x + 1,p.first + p.second - x - 1 };
			st.erase(itr);
			if (nexle.second > 0)st.insert(nexle);
			if (nexri.second > 0)st.insert(nexri);
		}
		else {
			P nexle = { p.first,p.second - 1 };
			P nexri = { p.first + p.second,x+1 - p.first - p.second };
			st.erase(itr);
			if (nexle.second > 0)st.insert(nexle);
			if (nexri.second > 0)st.insert(nexri);
		}
	}
	rep(i, n) {
		if (ans[i]) {
			cout << "Yes" << endl;
		}
		else {
			cout << "No" << endl;
		}
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	solve();
	//stop
	return 0;
}


```