// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// stream
//#include <istream>
#include <sstream>
//#include <ostream>
#include <fstream>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
#define OUT(dist) std::cout<<(dist);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t:" << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define REP(w, n) for(int w=0;w<int(n);++w)
#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)
#define FORLL(w, a, n) for(ll w=ll(a);w<ll(n);++w)
#define RFORLL(w, a, n) for(ll w=ll(n)-1;w>=ll(a);--w)
#define REPLL(w, n) for(ll w=0;w<ll(n);++w)
#define RREPLL(w, n) for(ll w=ll(n)-1;w>=0;--w)
#define IN(a, x, b) (a<=x && x<b)
template<class T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;

template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

#define random_shuffle "USE std::shuffle!";

// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-6;
constexpr int MOD = 998244353;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------

void NO() {
	OUT("No")BR;
	exit(0);
}

signed main() {
	INIT;

	VAR(int, n);
	VAR(std::string, s);

	s = "1" + s + "1";

	std::vector<int> c(n * 2, -1);
	std::vector<int> O, I, W, N;

	REP(i, n * 2) {
		auto t = s.substr(i, 2);
		/* */if (t == "10") O.emplace_back(i);
		else if (t == "01") I.emplace_back(i);
		else if (t == "11") W.emplace_back(i);
		else if (t == "00") N.emplace_back(i);
	}

	if (O.size() != I.size()) NO();
	if (W.size() % 2 != 0) NO();
	if (N.size() % 2 != 0) NO();

	int p = 1;
	if (W.size() % 4 == 2) {
		if (O.size() < 2) NO();

		int o1 = -1, o2 = -1;
		int w1 = -1, w2 = -1;

		// OIWOIW
		bool ok = [&] {
			int t = O[0];
			auto it1 = std::upper_bound(ALL(W), t);
			if (it1 == W.end()) return false;
			auto it2 = std::upper_bound(ALL(O), *it1);
			if (it2 == O.end()) return false;
			auto it3 = std::upper_bound(ALL(W), *it2);
			if (it3 == W.end()) return false;

			o1 = 0;
			o2 = it2 - O.begin();
			w1 = it1 - W.begin();
			w2 = it3 - W.begin();

			return true;
		}();

		if (!ok) {
			// WOIWOI
			ok = [&] {
				int t = W[0];
				auto it1 = std::upper_bound(ALL(O), t);
				if (it1 == O.end()) return false;
				auto it2 = std::upper_bound(ALL(W), *it1);
				if (it2 == W.end()) return false;
				auto it3 = std::upper_bound(ALL(O), *it2);
				if (it3 == O.end()) return false;

				o1 = it1 - O.begin();
				o2 = it3 - O.begin();
				w1 = 0;
				w2 = it2 - W.begin();

				return true;
			}();
		}

		if (!ok) NO();

		c[O[o1]] = c[I[o2]] = p++;
		c[O[o2]] = c[I[o1]] = p++;
		c[W[w1]] = c[W[w2]] = p++;

		O.erase(O.begin() + o2);
		O.erase(O.begin() + o1);
		I.erase(I.begin() + o2);
		I.erase(I.begin() + o1);
		W.erase(W.begin() + w2);
		W.erase(W.begin() + w1);
	}

	REP(i, O.size()) {
		c[O[i]] = c[I[i]] = p++;
	}

	for (int i = 0; i < W.size(); i += 4) {
		c[W[i + 0]] = c[W[i + 2]] = p++;
		c[W[i + 1]] = c[W[i + 3]] = p++;
	}

	for (int i = 0; i < N.size(); i += 2) {
		c[N[i]] = c[N[i + 1]] = p++;
	}

	OUT("Yes")BR;
	REP(i, n * 2) {
		OUT(c[i])SPBR(i, n * 2);
	}

	return 0;
}