#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int maxn = 500000;
int n;
pair<int, int> f[maxn + 5];
int ans[maxn + 5];
void print(int x, int y, bool flg) {
	for (int i = 1; i <= n; i++) {
		ans[f[i].se] = 3 - (i <= x) - (i <= y);
		if (flg) ans[f[i].se] = 4 - ans[f[i].se];
	}
	printf("YES\n");
	for (int i = 1; i <= n; i++) printf("%d", ans[i]);
}
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", &f[i].fi), f[i].se = i;
	sort(f + 1, f + n + 1);
	int x = f[n].fi, y;
	if (x > n - 2) return printf("NO"), 0;
	if (y = x + f[x].fi; y < n && n - y >= f[y].fi) return print(x, y, 0), 0;
	for (x = 1, y = f[n].fi + 1; y < n; x++, y++)
		if (x >= f[y].fi && n - y >= f[x].fi) return print(x, y, 1), 0;
	printf("NO");
}