#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 7;
int n, a[N], d[N], r[N];
int Get(int rk) { return a[d[rk]]; }
int main() {
	scanf("%d", &n), iota(d + 1, d + 1 + n, 1);
	for(int i = 1; i <= n; ++i) scanf("%d", a + i);
	sort(d + 1, d + 1 + n, [&](int x, int y) { return a[x] < a[y]; });
	for(int mx2 = n - 1; mx2 >= Get(n); --mx2) {
		if(Get(mx2) + Get(n) <= mx2) {
			if(Get(Get(mx2)) + Get(mx2) + Get(n) > n) continue;
			for(int i = mx2 + 1; i <= n; ++i) r[d[i]] = 1;
			for(int i = mx2 - Get(n) + 1; i <= mx2; ++i) r[d[i]] = 2;
			for(int i = Get(mx2) + 1; i <= mx2 - Get(n); ++i) r[d[i]] = 1;
			for(int i = 1; i <= Get(mx2); ++i) r[d[i]] = 3;
		} else if(Get(mx2) + Get(n) < n) {
			int mx3 = Get(mx2) + Get(n);
			if(Get(mx3) > n - mx3) continue;
			for(int i = mx3 + 1; i <= n; ++i) r[d[i]] = 1;
			for(int i = mx2 + 1; i <= mx3; ++i) r[d[i]] = 3;
			for(int i = mx2 - Get(n) + 1; i <= mx2; ++i) r[d[i]] = 2;
			for(int i = 1; i <= mx2 - Get(n); ++i) r[d[i]] = 3;
		} else continue;
		puts("YES"); for(int i = 1; i <= n; ++i) printf("%d", r[i]); return 0;
	}
	return puts("NO"), 0;
}