#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = a, I = b; i <= I; ++i)
#define per(i, a, b) for (int i = a, I = b; i >= I; --i)
template<typename T> void down(T &x, T y) { if (x > y) x = y; }

const int M = 200000 * 44;
int cnt, dfn, id[M], low[M], bel[M], stk[M], top, tot;
vector<int> e[M];
bool in_stk[M];

void tarjan(int u) {
    id[u] = low[u] = ++dfn;
    stk[++top] = u;
    in_stk[u] = true;
    for (auto v : e[u]) {
        if (!id[v]) {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        } else if (in_stk[v]) {
            low[u] = min(low[u], id[v]);
        }
    }
    if (id[u] == low[u]) {
        ++tot;
        for (; ; --top) {
            int x = stk[top];
            bel[x] = tot;
            in_stk[x] = false;
            if (x == u) break;
        }
    }
    in_stk[u] = false;
}

int ID(int x, int y) { 
    return x * 2 + y; 
}
void add(int x, int y) {
    e[x].push_back(y);
    e[y ^ 1].push_back(x ^ 1);
}

const int S = 1 << 19 | 5;
int t[S];
void cover(int p, int l, int r, int ll, int rr, int x) {
    if (l >= ll && r <= rr) {
        if (t[p]) add(x, t[p]);
        return;
    }
    int mid = (l + r) >> 1;
    if (mid >= ll) cover(p << 1, l, mid, ll, rr, x);
    if (mid < rr) cover(p << 1 | 1, mid + 1, r, ll, rr, x);
}
void add(int p, int l, int r, int pos, int x) {
    int prv = t[p];
    t[p] = ++cnt * 2;
    if (prv) add(t[p], prv);
    add(t[p], x);
    if (l == r) return;
    int mid = (l + r) >> 1;
    if (mid >= pos) add(p << 1, l, mid, pos, x);
    else add(p << 1 | 1, mid + 1, r, pos, x);
}

int n, a[200005], rk[200005];
bool ans[200005];
vector<int> pos[50005];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    cin >> n;
    rep(i, 1, 4 * n) {
        cin >> a[i];
        rk[i] = pos[a[i]].size();
        pos[a[i]].push_back(i);
    }

    cnt = n;
    per(i, 4 * n, 1) {
        int x = a[i];
        if (rk[i] == 2) {
            cover(1, 1, 4 * n, i, pos[x][3], ID(x, 0));
            add(1, 1, 4 * n, pos[x][3], ID(x, 1));
        } else if (rk[i] == 1) {
            cover(1, 1, 4 * n, i, pos[x][3], ID(x, 1));
            add(1, 1, 4 * n, pos[x][3], ID(x, 0));
        } else if (rk[i] == 0) {
            cover(1, 1, 4 * n, i, pos[x][1], ID(x, 0));
            cover(1, 1, 4 * n, i, pos[x][2], ID(x, 1));
            add(1, 1, 4 * n, pos[x][1], ID(x, 1));
            add(1, 1, 4 * n, pos[x][2], ID(x, 0));
        }
    }

    rep(i, 2, cnt * 2 + 1) if (!id[i]) tarjan(i);
    rep(i, 1, n) {
        int x = ID(i, 0), y = ID(i, 1);
        assert(bel[x] && bel[y]);
        if (bel[x] == bel[y]) {
            cout << "No\n";
            return 0;
        }
        ans[pos[i][0]] = 1;
        ans[pos[i][bel[x] < bel[y] ? 2 : 1]] = 1;
    }

    cout << "Yes\n";
    rep(i, 1, 4 * n) cout << ans[i];
    cout << "\n";

    return 0;
}