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