#include <bits/stdc++.h>
int main() {
  int n, s[200000], i, j = 0, door[200000], b4j = -1, count = 0;
  char ans[4];
  scanf("%d", &n);
  scanf("%s", s);
  ans[0] = 'N';
  ans[1] = 'o';
  ans[2] = '\0';
  for (i = 0; i < 100000; i++) door[i] = 0;
  door[0] = 1;
  for (i = 1; i < n; i++) {
    if (door[b4j + 1] != 0) {
      for (j = 0; j < (n - 1) * 2; j++) {
        if (j != b4j) {
          if (door[j] == door[b4j + 1]) {
            door[j + 1] = i;
            count++;
            break;
          }
        }
      }
    } else {
      for (j = 0; j < (n - 1) * 2; j++) {
        if (j != b4j + 1) {
          if (door[j] == 0) {
            if (s[j] == 1) {
              if (door[j + 1] == 0 && s[j + 1] == 1) {
                door[j + 1] = i;
                door[j + 2] = i + 1;
                b4j = j + 1;
              } else {
                door[j] = i;
                door[j + 1] = i + 1;
                b4j = j;
              }
              count++;
              break;
            }
          }
        }
      }
    }
    if (count != i) {
      printf("%s\n", ans);
      return 0;
    }
  }
  ans[0] = 'Y';
  ans[1] = 'e';
  ans[2] = 's';
  ans[3] = '\0';
  printf("%s\n", ans);
  for (i = 0; i < n * 2 - 1; i++) printf("%d''", door[i]);
  printf("%d\n", n);
  return 0;
}
