#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
template<typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template<typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
#define sz 233 

int n;
char s[sz];
int c[2];

void output(vector<int>*v) {
    cout<<"YES\n";
    static int a[sz];
    rep(i,0,n-1) {
        int t=(s[i]=='Y');
        cout<<(a[i]=v[t].back())<<' ';
        v[t].pop_back();
    }
    // rep(i,0,n-1) {
    //     vector<int>vv;
    //     int sum=0;
    //     rep(j,0,n-1) if (j!=i) vv.push_back(a[j]),sum+=a[j];
    //     bitset<sz*sz>dp;
    //     dp[0]=1;
    //     for (auto x:vv) dp|=dp<<x;
    //     int ok=(sum%2==0&&dp[sum/2]==1);
    //     assert(ok==(s[i]=='Y'));
    // }
    exit(0);
}

int main() {
    file();
    // mt19937 rng(time(0)+(size_t)(new char));
    // n=rng()%10+3;
    // rep(i,0,n-1) s[i]="YN"[rng()%2];
    // cerr<<s<<'\n';
    cin>>n;
    cin>>s;
    rep(i,0,n-1) c[s[i]=='Y']++;
    if (!c[0]) {
        if (n%2==0) return cout<<"NO\n",0;
        cout<<"YES\n";
        rep(i,0,n-1) cout<<1<<" \n"[i==n-1];
        return 0;
    }
    if (c[1]==1&&c[0]%2==1) {
        vector<int>v[2];
        rep(i,1,c[0]-1) v[0].push_back(2);
        v[0].push_back(4);
        v[1].push_back(1);
        output(v);
    }
    if (c[1]%2==0&&c[0]==1) {
        if (c[1]==2) return cout<<"NO\n",0;
        vector<int>v[2];
        v[0].push_back(3);
        rep(i,1,c[1]-1) v[1].push_back(1);
        v[1].push_back(c[1]+1);
        output(v);
    }
    if (c[1]%2==1) {
        assert(!(c[1]==1&&c[0]%2==1));
        vector<int>v[2]={vector<int>(c[0],2),vector<int>(c[1],1)};
        output(v);
    }
    if (c[1]%2==0&&c[0]%2==1) {
        assert(!(c[0]==1));
        vector<int>v[2];
        int sum=3;
        v[0].push_back(1),v[0].push_back(2);
        rep(i,3,c[0]) v[0].push_back(4),sum+=4;
        v[1]=vector<int>(c[1],sum);
        output(v);
    }
    if (c[1]%2==0&&c[0]%2==0) {
        assert(!(c[0]==0));
        vector<int>v[2]={vector<int>(c[0],1),vector<int>(c[1],2)};
        output(v);
    }
    assert(0);
}