#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod = 1000000007LL;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
template<class T> inline bool change(T a,T b){if(a > b){swap(a,b);return true;}return false;}
ll gcd(ll a,ll b){
    if(a < b)swap(a,b);
    if(a % b == 0)return b;
    else return gcd(b,a%b);
}
//素数判定O(sqrt(N))
bool isp(ll n){
    bool res = true;
    if(n == 1)return false;
    else{
        for(ll i = 2;i * i <= n;i++){
            if(n % i == 0){
                res = false;
                break;
            }
        }
        return res;
    }
}
const ll cmax = 1000000;
ll fac[cmax], finv[cmax], inv[cmax];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < cmax; i++){
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod%i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

// 二項係数計算
ll nCk(ll n, ll k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
//nのm乗をMODで割ったあまりO(logN)
ll modpow(ll n,ll m,ll MOD){
    ll res = 1;
    while(m){
        if(m & 1)res = (res * n) % MOD;
        m >>= 1;
        n *= n;
        n %= MOD;
    }
    return res;
}

//printf("%.10f\n", N);
/*  vector<ll> vec = {1,2,5,6,8,9,10};
    cout << binary_search(all(vec),5) << endl; -> true*/
/*
    vector<ll> vec = {1,2,5,6,8,9,10};
    auto n = upper_bound(all(vec),4);
    cout << *n << endl; -> 5*/

//    cout << fixed << setprecision(15);
ll N;
void out(vector<ll> q){
    rep(i,N){
        if(q[i] == 1)cout << "S";
        else cout << "W";
    }
    cout << "\n";
    return;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    string S;
    cin >> N >> S;
    vector<ll> hon(N);
    rep(i,4){
        ll last = 0,haj = 0;
        rep(j,N)hon[j] = 0;
        if(i == 1)hon[0] = 1;
        else if(i == 2)hon[1] = 1;
        else if(i == 3){
            hon[0] = 1;hon[1] = 1;
        }
        for(ll j = 1;j < N - 1;j++){
            if(S[j] == 'o'){
                if(hon[j]){
                    hon[j + 1] = hon[j - 1];
                }
                else{
                    hon[j + 1] = hon[j - 1] ^ 1;
                }
            }
            else{
                if(hon[j]){
                    hon[j + 1] = hon[j - 1] ^ 1;
                }
                else{
                    hon[j + 1] = hon[j - 1];
                }
            }
        }
        if(S[N - 1] == 'o'){
            if(hon[N - 1]){
                last = hon[N - 2];
            }
            else{
                last = hon[N - 2] ^ 1;
            }
        }
        else{
            if(hon[N - 1]){
                last = hon[N - 2] ^ 1;
            }
            else{
                last = hon[N - 2];
            }
        }
        if(S[0] == 'o'){
            if(hon[0]){
                haj = hon[1];
            }
            else{
                haj = hon[1] ^ 1;
            }
        }
        else{
            if(hon[0]){
                haj = hon[1] ^ 1;
            }
            else{
                haj = hon[1];
            }
        }
        if(last == hon[0] && haj == hon[N - 1]){
            out(hon);
            return 0;
        }
    }
    cout << "-1\n";
}

Measured memory_bytes: 4956