#include <bits/stdc++.h>
using namespace std;
template <class C>
void mini(C &a4, C b4) {
  a4 = min(a4, b4);
}
template <class C>
void maxi(C &a4, C b4) {
  a4 = max(a4, b4);
}
template <class TH>
void _dbg(const char *sdbg, TH h) {
  cerr << sdbg << '=' << h << endl;
}
template <class TH, class... TA>
void _dbg(const char *sdbg, TH h, TA... a) {
  while (*sdbg != ',') cerr << *sdbg++;
  cerr << '=' << h << ',';
  _dbg(sdbg + 1, a...);
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
  os << "[";
  for (auto vv : V) os << vv << ",";
  return os << "]";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
const long long MAX = 2e5 + 10;
long long n;
string s;
long long res[MAX];
long long znaj(long long a) {
  while (1) {
    a++;
    if (a == 2 * n) a = 0;
    if (res[a] != 0) return a;
  }
}
long long sumk[MAX];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  if (0) cout << fixed << setprecision(6);
  cin >> n >> s;
  s += '1';
  long long ost = 1;
  long long ak = 1;
  long long il = 2 * n + 1;
  vector<long long> spec;
  bool cz = 0;
  long long ilx = 0;
  for (long long i = (0); i <= ((long long)(n * 2) - 1); i++) {
    if (s[i] == '0') {
      cz = 0;
      if (ost == 0) {
        res[i] = il / 2;
        il--;
      } else {
        res[i] = ak;
      }
      ost = 0;
    } else {
      if (ost == 0) {
        res[i] = ak;
        ak++;
      } else {
        if (cz == 0) {
          cz = 1;
          spec.push_back(i);
        }
        ilx++;
      }
      ost = 1;
    }
  }
  if (ilx & 1) {
    cout << "No\n";
    return 0;
  }
  for (long long i = (0); i <= ((long long)(n * 2) - 1); i++) {
    if (0) cout << res[i] << " ";
  }
  if (0) cout << "\n";
  (ilx);
  if (ilx % 4 == 2) {
    if (res[1] == '1' && res[2 * n - 1] == '1') {
      spec.pop_back();
    }
    if (((long long)(spec).size()) == 1) {
      cout << "No\n";
      return 0;
    }
    res[spec[0]] = ak;
    res[spec[1]] = ak;
    ak++;
    long long a = znaj(spec[0]);
    long long b = znaj(spec[1]);
    swap(res[a], res[b]);
  }
  for (long long i = (0); i <= ((long long)(n * 2) - 1); i++) {
    sumk[res[i]] += i;
  }
  cout << "Yes\n";
  for (long long i = (0); i <= ((long long)(n * 2) - 1); i++) {
    if (0) cout << res[i] << " ";
  }
  if (0) cout << "\n";
  long long x = 0;
  vector<long long> pom;
  while (x != 2 * n) {
    if (res[x] != 0) {
      x = sumk[res[x]] - x;
    }
    if (res[x] == 0) pom.push_back(x);
    x++;
  }
  (pom);
  for (long long i = 0; i < ((long long)(pom).size()); i += 4) {
    res[pom[i]] = ak;
    res[pom[i + 1]] = ak + 1;
    res[pom[i + 2]] = ak;
    res[pom[i + 3]] = ak + 1;
    ak += 2;
  }
  for (long long i = (0); i <= ((long long)(n * 2) - 1); i++) {
    cout << res[i] << " ";
  }
  cout << "\n";
}
