#include <bits/stdc++.h>
#define N 510000
using namespace std;
int n, ans[N];
pair<int, int> a[N];
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; i++)
    cin >> a[i].first, a[i].second = i;
  sort(a + 1, a + n + 1);
  for (int i = 1; i < n; i++) {
    if (i >= a[n].first && i + a[i].first < n &&
        a[i + a[i].first].first <= n - (i + a[i].first)) {
      for (int j = 1; j <= i; j++)
        ans[a[j].second] = 1;
      for (int j = i + 1; j <= i + a[i].first; j++)
        ans[a[j].second] = 3;
      for (int j = i + a[i].first + 1; j <= n; j++)
        ans[a[j].second] = 2;
      cout << "YES" << '\n';
      for (int j = 1; j <= n; j++)
        cout << ans[j];
      cout << '\n';
      exit(0);
    } else {
      int l = i + a[n].first,
          r = min((int)(upper_bound(a + 1, a + n + 1, make_pair(i, n)) - a - 1),
                  n - a[i].first);
      if (l <= r && l < n) {
        for (int j = 1; j <= i; j++)
          ans[a[j].second] = 1;
        for (int j = i + 1; j <= l; j++)
          ans[a[j].second] = 2;
        for (int j = l + 1; j <= n; j++)
          ans[a[j].second] = 3;
        cout << "YES" << '\n';
        for (int j = 1; j <= n; j++)
          cout << ans[j];
        cout << '\n';
        exit(0);
      }
    }
  }
  cout << "NO" << '\n';
  return 0;
}