#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;
string s;
int ans[400000];

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

int main() {
	cin >> n >> s;
	assert(s.size() == 2 * n - 1);
	
	s = "1" + s + "1" + s;
	inc(i, 4 * n) { ans[i] = -1; }
	
	inc(i, 2 * n) {
		if(s.substr(i, 2) == "11") { a++; }
		if(s.substr(i, 2) == "10") { b++; }
	}
	
	if(a % 2 != 0) { no(); }
	
	int p = 0;
	{
		if(! (a % 4 == 0 || b >= 2)) { no(); }
		
		inc(i, 2 * n) {
			p = i;
			if(s.substr(i, 2) == "10") { break; }
		}
		
		int t = -1, z = 0, w = 0;
		vector<pair<int, int>> v[2];
		incID(i, p, p + 2 * n + 1) {
			if(s[i] == '0') { z++; }
			if(s.substr(i, 2) == "11") { w++; }
			if(s.substr(i, 2) == "10") {
				if(t >= 0) { v[(w == 0 ? 0 : 1)].EB(t, z); }
				t = i;
				z = 0;
				w = 0;
			}
		}
		if(a % 4 != 0 && v[1].size() < 2) { no(); }
		
		int c = 0;
		if(a % 4 != 0) {
			inc(i, 1) {
				int at = v[1][i + 0].FI;
				int az = v[1][i + 0].SE;
				int bt = v[1][i + 1].FI;
				int bz = v[1][i + 1].SE;
				
				ans[at     ] = c / 2; c++;
				ans[bt + bz] = c / 2; c++;
				ans[at + az] = c / 2; c++;
				ans[bt     ] = c / 2; c++;
				
				inc(j, 1) {
					ans[at + az + 1 + j] = c / 2; c++;
					ans[bt + bz + 1 + j] = c / 2; c++;
				}
			}
		}
		
		inc(k, 2) {
			inc(i, v[k].size()) {
				int at = v[k][i + 0].FI;
				int az = v[k][i + 0].SE;
				
				if(ans[at] != -1) { continue; }
				
				ans[at     ] = c / 2; c++;
				ans[at + az] = c / 2; c++;
			}
		}
		
		int cc = c;
		c -= cc;
		incID(i, p, p + 2 * n) {
			if(s.substr(i, 2) == "11") {
				if(ans[i] != -1) { continue; }
				ans[i] = (c / 4 * 2) + (c % 2) + cc / 2;
				c++;
			}
		}
		assert(c % 4 == 0);
		c += cc;
		
		incID(i, p, p + 2 * n) {
			if(ans[i] == -1) { ans[i] = c / 2; c++; }
		}
		
		assert(c == 2 * n);
	}
	
	// inc(i, 2 * n) { cout << s[p + i] << " "; } cout << endl;
	// inc(i, 2 * n) { cout << " " << ans[p + i] + 1; } cout << endl;
	
	inc(i, p) { ans[i] = ans[i + 2 * n]; }
	
	cout << "Yes" << endl;
	inc(i, 2 * n) { cout << (i == 0 ? "" : " ") << ans[i] + 1; }
	cout << endl;
	
	return 0;
}


Measured memory_bytes: 3768