#include<bits/stdc++.h>

using namespace std;

#define int long long
#define ar array
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()

#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)

template<class T>
bool umin(T &a, const T &b) {
    return b < a ? a = b, 1 : 0;
}

template<class T>
bool umax(T &a, const T &b) {
    return a < b ? a = b, 1 : 0;
}

template<class A>
void read(vt<A> &v);

template<class A, size_t S>
void read(ar<A, S> &a);

template<class T>
void read(T &x) {
    cin >> x;
}

void read(double &d) {
    string t;
    read(t);
    d = stod(t);
}

void read(long double &d) {
    string t;
    read(t);
    d = stold(t);
}

template<class H, class... T>
void read(H &h, T &... t) {
    read(h);
    read(t...);
}

template<class A>
void read(vt<A> &x) {
    EACH(a, x)read(a);
}

template<class A, size_t S>
void read(array<A, S> &x) {
    EACH(a, x)read(a);
}

string to_string(char c) {
    return string(1, c);
}

string to_string(bool b) {
    return b ? "true" : "false";
}

string to_string(const char *s) {
    return string(s);
}

string to_string(string s) {
    return s;
}

string to_string(vt<bool> v) {
    string res;
    FOR(sz(v))res += char('0' + v[i]);
    return res;
}

template<size_t S>
string to_string(bitset<S> b) {
    string res;
    FOR(S)res += char('0' + b[i]);
    return res;
}

template<class T>
string to_string(T v) {
    bool f = 1;
    string res;
    EACH(x, v) {
        if (!f)
            res += ' ';
        f = 0;
        res += to_string(x);
    }
    return res;
}

template<class A>
void write(A x) {
    cout << to_string(x);
}

template<class H, class... T>
void write(const H &h, const T &... t) {
    write(h);
    write(t...);
}

void print() {
    write("\n");
}

template<class H, class... T>
void print(const H &h, const T &... t) {
    write(h);
    if (sizeof...(t))
        write(' ');
    print(t...);
}

template<class T, class U>
void vti(vt<T> &v, U x, size_t n) {
    v = vt<T>(n, x);
}

template<class T, class U>
void vti(vt<T> &v, U x, size_t n, size_t m...) {
    v = vt<T>(n);
    EACH(a, v) vti(a, x, m);
}


int n;


void solve() {
    string s;
    read(n, s);
    vt<int> ans(n, -1);
    
    /*
     * 0-->s
     * 1--->w
     *
     *
     *
     */
    
    FOR(1 << 3) {
        ans[0] = i & 1;
        ans[1] = (i & (1 << 1))>0;
        ans[n - 1] = (i & (1 << 2))>0;  // 110
        
        bool ok = 1;
        
        if (s[0] == 'o') {
            if (!ans[0]) {
                ok &= (ans[1] == ans[n-1]);
            }
            else{
                ok &= (ans[1] ^ ans[n-1]);
            }
        }
        else{
            if (ans[0]) {
                ok &= (ans[1] == ans[n-1]);
            }
            else{
                ok &= (ans[1] ^ ans[n-1]);
            }
        }
        
        if (!ok) continue;
        
        int val = ans[n - 1];
        
        FOR(j, 1, n - 1) {
            if (s[j] == 'o') {
                if (!ans[j])
                    ans[j + 1] = ans[j - 1];
                else
                    ans[j + 1] = !ans[j - 1];
            }
            else{
                if (ans[j]) {
                    ans[j + 1] = ans[j - 1];
                }
                else{
                    ans[j + 1] = !ans[j - 1];
                }
            }
        }
        
        ok &= (val == ans[n - 1]);
        
        if (s[n - 1] == 'o') {
            if (!ans[n - 1]) {
                ok &= (ans[n - 2] == ans[0]);
            }
            else{
                ok &= (ans[n - 2] ^ ans[0]);
            }
        }
        else{
            if (ans[n - 1]) {
                ok &= (ans[n - 2] == ans[0]);
            }
            else{
                ok &= (ans[n - 2] ^ ans[0]);
            }
        }
        
        if (ok) {
            FOR(j, n) {
                write(ans[j] ? 'W' : 'S');
            }
            return;
        }
    }
    
    print(-1);
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int tt = 1;
//    read(tt);
    FOR(tt) {
//        write("Case #", i + 1, ": ");
        solve();
    }
    
}



Measured memory_bytes: 4248