#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
typedef long long ll;
typedef double db;
typedef pair<int, int> PII;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;
int lowbit(int x){return x&-x;}
int rnd(int x) {return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
inline ll rd(){ll x=0;char ch;bool f=true;for(ch=getchar();!isdigit(ch);ch=getchar())if(ch=='-')f^=f;for(;isdigit(ch);ch=getchar())x=(x<<3)+(x<<1)+(ch^48);return f?x:-x;}
inline void wr(ll x){if(x<0)putchar('-'),x=-x;if(x>9)wr(x/10);putchar(x%10+48);}
inline void wr(char *s){printf("%s",s);}
// head

const int N = 100010;

void solve() {
	int n;
	cin >> n;
	queue<int> q;
	stack<int> stk;
	priority_queue<int> big;
	priority_queue<int, vector<int>, greater<>> small;
	vector<int> res{1, 1, 1, 1};
	for (int i = 1; i <= n; i ++ ) {
		int o, x;
		cin >> o >> x;
		if (o == 1) {
			q.push(x);
			stk.push(x);
			big.push(x);
			small.push(x);
		} else {
			if (q.size()) {
				int a = q.front();
				if (a != x) res[0] = 0;
				q.pop();
			} else res[0] = 0;
			
			if (stk.size()) {
				int b = stk.top();
				if (b != x) res[1] = 0;
				stk.pop();
			} else res[1] = 0;
			
			if (big.size()) {
				int c = big.top();
				if (c != x) res[2] = 0;
				big.pop();
			} else res[2] = 0;
			
			if (small.size()) {
				int d = small.top();
				if (d != x) res[3] = 0;
				small.pop();
			} else res[3] = 0;
		}
	}
	if (res[0]) cout << "Yes\n";
	else cout << "No\n";
	if (res[1]) cout << "Yes\n";
	else cout << "No\n";
	if (res[2]) cout << "Yes\n";
	else cout << "No\n";
	if (res[3]) cout << "Yes\n";
	else cout << "No\n";
}

int main() {
	int T = 1;
	//T = rd();
	while (T -- ) {
		solve();
	}
	return 0;
}