#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

int main(){
    int N; cin >> N;
    string s; cin >> s;

    // 0 : sheep
    // 1 : walf
    for(int i=0;i<2;i++){
        for(int j=0;j<2;j++){
            vector<int> v(N,-1);
            v[0] = i;
            v[1] = j;
            for(int k=1;k<N;k++){
                int l = (k-1+N) % N;
                int r = (k+1+N) % N;

                if(v[k]==0){
                    if(s[k]=='o'){
                        v[r] = v[l];
                    }else{
                        v[r] = v[l] ^ 1;
                    }
                }else{
                    if(s[k]=='o'){
                        v[r] = v[l] ^ 1;
                    }else{
                        v[r] = v[l];
                    }
                }
            }

            bool ok = [&](){
                for(int i=0;i<N;i++){
                    int l = (i-1+N) % N;
                    int r = (i+1+N) % N;
                    if(v[i]==0){ 
                        if(s[i]=='o' and v[l]!=v[r]) return false;
                        else if(s[i]=='x' and v[l]==v[r]) return false;
                    }else{
                        if(s[i]=='o' and v[l]==v[r]) return false;
                        else if(s[i]=='x' and v[l]!=v[r]) return false;
                    }
                }
                return true;
            }();

            if(ok){
                for(const auto& p : v){
                    if(p==0) cout << 'S';
                    else cout << 'W';
                }
                cout << endl;
                return 0;
            }
        }
    }
    cout << -1 << endl;
    return 0;
}


Measured memory_bytes: 1016