#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<random>
using namespace std;
const int N=2e5+10,mod=998244353;
int n,m,a[N];
int val[N],col[N];
vector<int> b;
vector<int> pos[N];
vector<pair<int,int>> g;
bool solve() {
	sort(g.begin(),g.end());
	int mr=g[0].second;
	for(int i=1; i<(int)g.size(); i++) {
		if(g[i].second<mr) return 0;
		mr=max(mr,g[i].second);
	}
	printf("Yes\n");
	return 1;
}
int main() {
	scanf("%d",&n); n*=4;
	for(int i=1; i<=n; i++) scanf("%d",&a[i]),b.push_back(a[i]);
	sort(b.begin(),b.end());
	m=unique(b.begin(),b.end())-b.begin();
	b.resize(m);
	for(int i=1; i<=n; i++) {
		a[i]=lower_bound(b.begin(),b.end(),a[i])-b.begin()+1;	
		pos[a[i]].push_back(i);
	}
	for(int i=1; i<=m; i++) {
		g.push_back({pos[i][0],pos[i][1]});
		g.push_back({pos[i][2],pos[i][3]});
	}
	if(solve()) {
		for(int i=1; i<=m; i++) {
			col[pos[i][0]]=col[pos[i][2]]=0;
			col[pos[i][1]]=col[pos[i][3]]=1;
		}
		for(int i=1; i<=n; i++) printf("%d",col[i]);
		return 0;
	}
	g.clear();
	for(int i=1; i<=m; i++) {
		g.push_back({pos[i][0],pos[i][2]});
		g.push_back({pos[i][1],pos[i][3]});
	}
	if(solve()) {
		for(int i=1; i<=m; i++) {
			col[pos[i][0]]=col[pos[i][1]]=0;
			col[pos[i][2]]=col[pos[i][3]]=1;
		}
		for(int i=1; i<=n; i++) printf("%d",col[i]);
		return 0;
	}
	printf("No\n");
	return 0;
}