#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define inf 1e9
#define pii pair <int, int>
const int mod = 1e9 + 7;
inline int read () {
	int x = 0, f = 1;
	char ch = getchar ();
	while (ch < '0' || ch > '9') f = ((ch == '-') ? -1 : f), ch = getchar ();
	while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar ();
	return x * f;
}
inline void write (int x) {
	if (x < 0) x = -x, putchar ('-');
	if (x >= 10) write (x / 10);
	putchar (x % 10 + '0');
}
inline int quickmod (int x, int y) {
	int Ans = 1;
	while (y) {
		if (y & 1) Ans = (Ans * x) % mod;
		x = (x * x) % mod;
		y >>= 1;
	}
	return Ans;
}
int n;
pii a[500005];
int ans[500005];
signed main () {
//	freopen (".in", "r", stdin);
//	freopen (".out", "w", stdout);
	n = read();
	for(int i = 1; i <= n; i++) a[i] = mp(read(), i);
	
	sort(a + 1, a + 1 + n);
	
	for(int i = 1; i <= n; i++) {
		for(int j = i + 1; j <= n; j++) {
			if(a[n].first <= j - i && a[i].first <= n - j && a[j].first <= i) {
				for(int t = 1; t <= i; t++) ans[a[t].second] = 3;
				for(int t = i + 1; t <= j; t++) ans[a[t].second] = 2;
				for(int t = j + 1; t <= n; t++) ans[a[t].second] = 1;
				puts("YES");
				for(int t = 1; t <= n; t++) write(ans[t]);
				putchar('\n');
				return 0;
			}
		}
	}
	puts("NO");
	return 0;
}
/*
10
5 3 2 2 3 2 5 3 3 3

*/