#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);++i)
#define FORE(x,c) for(auto &x:c)
#define FOR(i,a,n) for(int i=a,i##_len=(int)n;i<i##_len;++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i=((int)(n)-1);i>=0;--i)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)   // c++14
#define SZ(c) ((int)c.size())
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0}, DY[9]={-1,0,1,0,-1,1,1,-1,0};
const int INF=1001001001; const long long INFLL=1001001001001001001ll;
template<class T> ostream& operator << (ostream &os, const vector<T> &v) {
    ITR(i,v) os << *i << (i==end(v)-1 ? "" : " "); return os; }
template<class T> istream& operator >> (istream &is, vector<T> &v) {
    ITR(i,v) is >> * i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
        is >> p.first >> p.second; return is; }
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//------------------------------------------------------------------------------
struct before_main_function {
    before_main_function() {
    #ifdef int
        cerr<<"\x1b[7m"<<"'int' is defined as 'long long' !!!!"<<"\x1b[m"<<endl;
    #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(12)<<fixed;
    }
} before_main_function;
//------------------------------------------------------------------------------
int n;
string s;
const bool S=true;
const bool W=false;
bool hoge(vector<bool> &t) {
    int ret=0;
    FOR(i,1,n) {
        if(i!=n-1) {
            if(t[i]==S) {
                if(s[i]=='o') {
                    t.push_back(t[i-1]);
                }
                else {
                    t.push_back(!t[i-1]);
                }
            }
            else {
                if(s[i]=='o') {
                    t.push_back(!t[i-1]);
                }
                else {
                    t.push_back(t[i-1]);
                }
            }
        }
        else {
            if(t[i]==S) {
                if(s[i]=='o') {
                    ret=(t[i-1]==t[0]);
                }
                else {
                    ret=(t[i-1]!=t[0]);
                }
            }
            else {
                if(s[i]=='o') {
                    ret=(t[i-1]!=t[0]);
                }
                else {
                    ret=(t[i-1]==t[0]);
                }
            }
        }
    }
    if(t[0]==S) {
        if(s[0]=='o') ret+=(t[n-1]==t[1]);
        else ret+=(t[n-1]!=t[1]);
    }
    else {
        if(s[0]=='o') ret+=(t[n-1]!=t[1]);
        else ret+=(t[n-1]==t[1]);
    }
    return ret==2;
}
string fuga(vector<bool> a) {
    string ret="";
    for(bool x:a) {
        if(x==S) ret+="S";
        else ret+="W";
    }
    return ret;
}
signed main() {
    cin>>n>>s;
    vector<bool> a={S,S},b={S,W},c={W,S},d={W,W};
    /* */ if(hoge(a)) cout<<fuga(a)<<endl;
    else if(hoge(b)) cout<<fuga(b)<<endl;
    else if(hoge(c)) cout<<fuga(c)<<endl;
    else if(hoge(d)) cout<<fuga(d)<<endl;
    else cout<<-1<<endl;
    return 0;
}


Measured memory_bytes: 768