#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, a, b, ans[200000];
string s;

void no() {
	cout << "No" << endl;
	exit(0);
}

int cnt = 1;
void paint(int x, int y) {
	x %= 2 * n;
	y %= 2 * n;
	assert((ans[x] == 0) == (ans[y] == 0));
	if(ans[x] != 0) { return; }
	ans[x] = cnt;
	ans[y] = cnt;
	cnt++;
}

int main() {
	cin >> n >> s;
	assert(s.size() == 2 * n - 1);
	
	s = "1" + s + "1" + s;
	
	inc(i, 2 * n) {
		if(s.substr(i, 2) == "11") { a++; }
		if(s.substr(i, 2) == "10") { b++; }
	}
	if(a % 2 != 0) { no(); }
	
	if(a % 4 != 0 && b == 0) { no(); }
	
	if(b == 0) {
		assert(a % 4 == 0);
		inc(i, a / 4) {
			paint(i * 4 + 0, i * 4 + 2);
			paint(i * 4 + 1, i * 4 + 3);
		}
	} else {
		int p = 0;
		inc(i, 2 * n) {
			if(s.substr(i, 2) == "10") { p = i; break; }
		}
		
		vector<pair<int, int>> v[2];
		int x = -1;
		incID(i, p, p + 2 * n) {
			if(s.substr(i, 2) == "10") { x = i; }
			if(s.substr(i, 2) == "01") { v[s.substr(i + 1, 2) == "11" ? 1 : 0].EB(x, i); }
		}
		
		if(a % 4 != 0) {
			if(v[1].size() < 2) { no(); }
			paint(v[1][0].FI,     v[1][1].SE);
			paint(v[1][0].SE,     v[1][1].FI);
			paint(v[1][0].SE + 1, v[1][1].SE + 1);
		}
		
		inc(k, 2) {
		inc(i, v[k].size()) {
			paint(v[k][i].FI, v[k][i].SE);
		}
		}
		
		vector<int> w;
		incID(i, p, p + 2 * n) { if(s.substr(i, 2) == "11" && ans[i % (2 * n)] == 0) { w.PB(i); } }
		incID(i, p, p + 2 * n) { if(s.substr(i, 2) == "00") { w.PB(i); } }
		inc(i, w.size() / 4) { swap(w[i * 4 + 1], w[i * 4 + 2]); }
		
		inc(i, w.size() / 2) { paint(w[i * 2], w[i * 2 + 1]); }
	}
	
	cout << "Yes" << endl;
	inc(i, 2 * n) { cout << (i == 0 ? "" : " ") << ans[i]; }
	cout << endl;
	
	return 0;
}
