#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> P1;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define mp1(a,b,c) P1(a,P(b,c))

const int INF=1000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};

int main(){
	static int N;
	static string s;
	cin >> N >> s;
	
	static int ans[200010] = {};
	
	vector<int> vec;
	int k = 0;
	int a,b,c,d;
	for(int i = 0 ; i < 2*N-1 ; i ++){
		if(s[i] == '0'){
			if(i == 0 || s[i-1] == '1'){
				k ++;
				ans[i] = k;
			}
			else vec.pb(i);
		}
		else {
			//if(i == 2*N-2 || ( i != 0 && s[i-1] == '0')){
			if(i != 0 && s[i-1] == '0'){
				ans[i] = k;
			}
		}
	}
	
	/*for(int i = 0 ; i < 2*N ; i ++){
		printf("%d%c",ans[i],(i==2*N-1)?'\n':' ');
	}*/
	
	if(s[2*N-2] == '0'){
		ans[2*N-1] = k;
	}
	if(vec.size()%2 == 1){
		//puts("1");
		puts("No");
		return 0;
	}
	for(int i = 0 ; i < vec.size() ; i ++){
		if(i%2 == 0)k ++;
		ans[vec[i]] = k;
	}
	
	/*for(int i = 0 ; i < 2*N ; i ++){
		printf("%d%c",ans[i],(i==2*N-1)?'\n':' ');
	}*/
	
	vec.clear();
	for(int i = 0 ; i < 2*N ; i ++){
		if(ans[i] == 0)vec.pb(i);
	}
	if(vec.size()%4 != 0){
		a = -1;
		b = -1;
		for(int i = 0 ; i+1 < vec.size() ; i ++){
			if(vec[i]+1 != vec[i+1]){
				a = vec[i]+1;
				b = vec[i+1]-1;
			}
		}
		if(a == -1){
			//puts("2");
			puts("No");
			return 0;
		}
		c = -1;
		d = -1;
		for(int i = 0 ; i < 2*N ; i ++){
			if(ans[i] != 0 && (i < a || b < i)){
				if(i == 0 || ans[i-1] == 0)c = i;
				if(i == 2*N-1 || ans[i+1] == 0)d = i;
			}
		}
		if(c == -1){
			//puts("3");
			puts("No");
			return 0;
		}
		swap(ans[b],ans[d]);
		k ++;
		ans[a-1] = k;
		ans[b+1] = k;
	}
	vec.clear();
	for(int i = 0 ; i < 2*N ; i ++){
		if(ans[i] == 0)vec.pb(i);
	}
	for(int i = 0 ; i < vec.size() ; i ++){
		if(i%4 == 0 || i%4 == 2){
			ans[vec[i]] = k+1;
		}
		else ans[vec[i]] = k+2;
		if(i%4 == 3)k += 2;
	}
	
	puts("Yes");
	for(int i = 0 ; i < 2*N ; i ++){
		printf("%d%c",ans[i],(i==2*N-1)?'\n':' ');
	}
}
	

