#include <bits/stdc++.h>
using namespace std;
int n, len, count_0, count_1, cnt, xx, yy;
char s[402020];
int ans[402020], dog[402020], nxt[402020], l[402020], r[402020];
bool br[402020];
vector<int> a[402020];
int main() {
  bool sxy = 0;
  int doe = 0;
  scanf("%d", &n);
  for (int i = 0; i < n / 2 + 1; ++i) {
    dog[i * 4 + 1] = i * 2 + 1;
    dog[i * 4 + 2] = i * 2 + 2;
    dog[i * 4 + 3] = i * 2 + 1;
    dog[i * 4 + 4] = i * 2 + 2;
  }
  len = 2 * n;
  scanf("%s", s + 1);
  s[0] = '1';
  for (int i = 0; i < len; ++i) {
    if (s[i] == '1')
      ++count_1;
    else
      ++count_0;
  }
  if (!count_0) {
    if (n % 2)
      printf("No\n");
    else {
      printf("Yes\n");
      for (int i = 1; i <= len; ++i) printf("%d ", dog[i]);
      printf("\n");
    }
    return 0;
  }
  if (n == 1) {
    printf("Yes\n1 1\n");
    return 0;
  }
  for (int i = 1; i < len; ++i) {
    int x = i, y = (i + 1) % len;
    if (s[x] == '0' && s[y] == '1') {
      ++cnt;
      a[cnt].push_back(x);
      a[cnt].push_back(y);
      y = (y + 1) % len;
      while (s[y] == '1') {
        ++doe;
        a[cnt].push_back(y);
        y = (y + 1) % len;
      }
    }
  }
  for (int i = 1; i < cnt; ++i) r[i] = i + 1;
  r[cnt] = 1;
  for (int i = 2; i <= cnt; ++i) l[i] = i - 1;
  l[1] = cnt;
  if (doe % 2) {
    printf("No\n");
    return 0;
  }
  if (doe % 4 == 2)
    for (int i = cnt; i >= 1; --i)
      if (a[i].size() > 2) {
        if (sxy == 0)
          xx = i, sxy = 1;
        else {
          r[l[xx]] = r[xx];
          r[l[yy]] = r[yy];
          l[r[xx]] = l[xx];
          l[r[yy]] = l[yy];
          int c = a[i].size() - 1;
          yy = i;
          nxt[a[yy][0]] = a[yy][c];
          br[a[yy][0]] = 1;
          nxt[a[yy][c]] = a[yy][0];
          br[a[yy][c]] = 1;
          nxt[a[xx][1]] = a[yy][1];
          br[a[xx][1]] = 1;
          nxt[a[yy][1]] = a[xx][1];
          br[a[yy][1]] = 1;
          doe -= 2;
          break;
        }
      }
  if (doe % 4 == 2) {
    printf("No\n");
    return 0;
  }
  for (int i = 1; i <= cnt; ++i)
    if (i != xx && i != yy) {
      nxt[a[i][0]] = a[l[i]][a[l[i]].size() - 1];
      br[a[i][0]] = 1;
      nxt[a[i][a[i].size() - 1]] = a[r[i]][0];
      br[a[i][a[i].size() - 1]] = 1;
    }
  int id = a[1][1], num = 0;
  while (num < doe) {
    while (br[id]) id = nxt[id], id = (id + 1) % len;
    ++num;
    ans[id] = dog[num];
    id = (id + 1) % len;
  }
  num /= 2;
  bool flag = 0;
  for (int i = 0; i < len; ++i)
    if (!ans[i])
      if (nxt[i]) {
        ++num;
        ans[i] = num;
        ans[nxt[i]] = num;
      }
  for (int i = 0; i < len; ++i)
    if (!ans[i]) {
      flag ^= 1;
      if (flag) ++num;
      ans[i] = num;
    }
  printf("Yes\n");
  for (int i = 0; i < len; ++i) printf("%d ", ans[i]);
  printf("\n");
  return 0;
}
