#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:16777216")
#include <string>
#include <vector>
#include <map>
#include <list>
#include <iterator>
#include <cassert>
#include <set>
#include <queue>
#include <iostream>
#include <sstream>
#include <stack>
#include <deque>
#include <cmath>
#include <memory.h>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <utility>
#include <time.h>
#include <complex>
using namespace std;

#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, b, a) for(int i=(b)-1;i>=(a);--i)
#define FILL(A,value) memset(A,value,sizeof(A))

#define ALL(V) V.begin(), V.end()
#define SZ(V) (int)V.size()
#define PB push_back
#define MP make_pair
#define Pi 3.14159265358979
#define x0 ikjnrmthklmnt
#define y0 lkrjhkltr
#define y1 ewrgrg

typedef long long Int;
typedef unsigned long long UInt;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef pair<Int, Int> PLL;
typedef pair<double, double> PDD;
typedef complex<double> base;

const int INF = 1000000000;
const int BASE = 1000000007;
const int MAX = 200000;
const int MAX2 = 7777;
const int MAXE = 100000;
const int ADD = 1000000;
const int MOD = 1000000007;
const int CNT = 800;

set<pair<VI, VI> > S;

pair<VI, VI> small(int a, int b)
{
    for(auto it = S.begin(); it != S.end(); ++it)
    {
        int x = it->first.size();
        int y = it->second.size();

        if (a >= x && b >= y && (a - x) % 2 == 0 && (b - y) % 2 == 0)
        {
            return *it;
        }

    }
    return {{}, {}};
}

pair<VI, VI> addYes(pair<VI, VI> a, int k)
{
    int s = 0;
    FOR(i,0,SZ(a.first))
        s += a.first[i];
    FOR(i,0,SZ(a.second))
        s += a.second[i];


    FOR(i,0,k)
    {
        a.first.push_back(s);
    }
    return a;
}

pair<VI, VI> addNo(pair<VI, VI> a, int k)
{
    int s = 0;
    FOR(i,0,SZ(a.first))
        s += a.first[i];
    FOR(i,0,SZ(a.second))
        s += a.second[i];

    FOR(i,0,k)
    {
        a.second.push_back(s + 1);
    }
    return a;
}

int main()
{

    S.insert( MP( VI({1}) , VI({}) ) );
    S.insert( MP( VI({}) , VI({1, 2}) ));
    S.insert( MP( VI({}), VI({1,2,4}) ));
    S.insert( MP( VI({1,7,5,9}), VI({3}) ) );
    S.insert( MP( VI({4}), VI({1,1,2}) ) );
    S.insert( MP( VI({1, 1, 1}), VI({2}) ) );

    int n;
    cin >> n;

    string s;
    cin >> s;

    VI A, B;

    FOR(i,0,SZ(s))
    {
        if (s[i] == 'Y')
        {
            A.push_back(i);
        }
        else
        {
            B.push_back(i);
        }
    }

    pair<VI, VI> x = small(SZ(A) , SZ(B));

    if (x.first.size() == 0 && x.second.size() == 0)
    {
        cout << "NO" << endl;
        return 0;
    }

    x = addYes(x , SZ(A) - x.first.size());
    x = addNo(x , SZ(B) - x.second.size());



    cout << "YES" << endl;

    int sy = 0;
    int sn = 0;

    VI res;

    FOR(i,0,SZ(s))
    {
        if (s[i] == 'Y')
        {
            res.push_back(x.first[sy ++]);
        }
        else
        {
            res.push_back(x.second[sn ++]);
        }
    }


    FOR(i,0,SZ(res))
    {
        cout << res[i] << (i + 1 < n ? ' ' : '\n');
    }




    return 0;
}