#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
const ll MOD=1e9+7;
void NO(){ cout<<"No"<<endl; exit(0);}
int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
	int n;
	string s;
	cin>>n>>s;
	s="1"+s+"1";
	n=s.size();
	vector<int> re(n-1);
	vector<int> cs(n-1);
	rep(i,n-1) cs[i]=2*(s[i]-'0')+(s[i+1]-'0');
	vector<pii> ps;
	int cnt=0;
	vector<int> zeros;
	rep(i,n-1){
		if(cs[i]==0){
			zeros.pb(i);
		}else{
			if(cs[i-1]==0){
				re[i]=re[ps.back().X]=cnt++;
				assert(ps.back().Y==2);
				ps.pop_back();
			}else{
				ps.eb(i,cs[i]);
			}
		}
	}
	if(zeros.size()%2) NO();
	rep(i,zeros.size())if(i%2) re[zeros[i-1]]=re[zeros[i]]=cnt++;
	int s3=0;
	for(pii p:ps)if(p.Y==3) ++s3;
	if(s3%2) NO();
	int id=-1;
	if(s3%4){
		reps(i,1,(int)ps.size()-1){
			if(ps[i-1].Y==1 && ps[i].Y==3 && ps[i+1].Y==2){ id=i; break;}
		}
		if(id<0) NO();
	}
	vector<int> vs;
	int prv;
	rep(i,ps.size()){
		if(id>=0 && abs(i-id)<=1) continue;
		if(ps[i].Y==2){
			prv=ps[i].X;
		}else if(ps[i].Y==1){
			re[ps[i].X]=re[prv]=cnt++;
		}else{
			vs.pb(ps[i].X);
			if(vs.size()==4){
				re[vs[0]]=re[vs[2]]=cnt++;
				re[vs[1]]=re[vs[3]]=cnt++;
				vs.clear();
			}
		}
	}
	out(id,ps,vs,1);
	assert(vs.size()==s3%4/2);
	if(s3%4){
		re[vs[0]]=re[ps[id].X]=cnt++;
		re[ps[id-1].X]=re[ps[id+1].X]=cnt++;
	}
	out(re,1);
	cout<<"Yes"<<endl;
	rep(i,n-1) cout<<re[i]+1<<" \n"[i+1==n-1];
  return 0;
}
