#include <bits/stdc++.h>
using namespace std;
 
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e9
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }
template<class T>void show(vector<T>v){for (int i = 0; i < v.size(); i++){cerr<<v[i]<<" ";}cerr<<"\n";}
typedef long long ll;

int n;
char z[100010],u[100010],v[100010],w[100010];
bool ok=true;
void check(char* t,string s){
    for (int i = 0; i < n; i++)
    {
        if(s[i]=='o' && t[i]=='S'){
            if(t[(i-1+n)%n]!=t[(i+1)%n]){
                ok=false;
                break;
            }
        }
        else if(s[i]=='o' && t[i]=='W'){
             if(t[(i-1+n)%n]==t[(i+1)%n]){
                ok=false;
                break;
            }
        }

        else if(s[i]=='x' && t[i]=='S'){
         //   cerr<<"a";
         //   cerr<<t[(i-1+n)%n]<<t[(i+1)%n];
             if(t[(i-1+n)%n]==t[(i+1)%n]){
                ok=false;
              //  cerr<<'b';
                break;
            }
        }

        else if(s[i]=='x' && t[i]=='W'){
             if(t[(i-1+n)%n]!=t[(i+1)%n]){
                ok=false;
                break;
            }
        }
    }
}

void func(char * t,string s){
   // cerr<<s<<endl;
     for (int i = 1; i < n-1; i++)
    {
        if(s[i]=='o' && t[i]=='S'){
           t[(i+1)%n]=t[i-1];
        }
        else if (s[i]=='o' && t[i]=='W'){
            t[(i+1)%n]=(t[(i-1+n)%n]=='S')?'W':'S';            
        }
        else if (s[i]=='x' && t[i]=='S'){
             t[(i+1)%n]=(t[(i-1+n)%n]=='S')?'W':'S';            
        
        }
        else if (s[i]=='x' && t[i]=='W'){
             t[(i+1)%n]=(t[(i-1+n)%n]=='S')?'S':'W';            
        }
    }
    
}

signed main(){
    

    string s;
    cin>>n>>s;
    
    z[0]='S';
    z[1]='S';
    func(z,s);
    check(z,s);

    if(ok){
        for (int i = 0; i < n; i++)
        {
            cout<<z[i];
        }
        cout<<endl;
        return 0;
    }
    ok=true;
    u[0]='S';
    u[1]='W';
    func(u,s);
    check(u,s);
    
    if(ok){
        for (int i = 0; i < n; i++)
        {
            cout<<u[i];
        }
        cout<<endl;
        return 0;
    }
    ok=true;
    v[0]='W';
    v[1]='S';
    func(v,s);
    check(v,s);

    if(ok){
        for (int i = 0; i < n; i++)
        {
            cout<<v[i];
        }
        cout<<endl;
        return 0;
    }
    ok=true;
    w[0]='W';
    w[1]='W';
    func(w,s);
    check(w,s);
    if(ok){
        for (int i = 0; i < n; i++)
        {
            cout<<w[i];
        }
        cout<<endl;
        return 0;
    }
    else{
        cout<<-1<<endl;
    }

 
  
   
   
   
    
    
    
    return 0;
}

Measured memory_bytes: 896