#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

const int N = 1e5 + 10;
int n, s1[N], s2[N], sum[N];
pair<int, int> a[N];

int main()
{
	cin >> n;
	for (int i = 0; i < n; ++i)
	{
		cin >> a[i].first;
		a[i].second = i;
	}
	sort(a, a + n);
	reverse(a, a + n);
	sum[0] = a[0].first;
	int t = 0, s = 0;
	s1[t++] = a[0].first;
	for (int i = 1; i < n; ++i)
	{
		if ((sum[t - 1] + a[i].first <= n - t) && (!((a[i].first == 0) && (sum[t - 1] + a[i].first < n - t))))
		{
			sum[t] = sum[t - 1] + a[i].first;
			s1[t++] = a[i].second;
		}
		else
		{
			s2[s++] = a[i].second;
		}
	}
	if (sum[t - 1] != n - t)
	{
		cout << "NO";
		return 0;
	}
	for (int i = 0; i < t; ++i)
	{
		a[s1[i]].first = 1;
	}
	for (int i = 0; i < s; ++i)
	{
		a[s2[i]].first = 2;
	}
	cout << "YES\n";
	for (int i = 0; i < n; ++i)
	{
		cout << a[i].first << ' ';
	}
}