#include <bits/stdc++.h>
using namespace std;
int n, a[500007], c[500007], mx;
int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i)
		scanf("%d", a + i), ++c[a[i]], mx = max(mx, a[i]);
	for(int i = n, p = n, m = 0, x = 1, l = 0; i >= 1; --i) {
		if(m += c[i], !c[i]) continue;
		while(p >= i || !c[p]) --p;
		while(x <= m || !c[x]) l += c[x++];
		if(mx + p < n - m || l < p) continue;
		puts("YES");
		for(int j = 1; j <= n; ++j)
			if(a[j] >= i) putchar('1');
			else if(a[j] >= x) putchar('2');
			else if(p) putchar('3'), --p;
			else putchar('2');
		return 0;
	}
	return puts("NO"), 0;
}