import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N = lread();
    auto S = sread();
    outer: foreach (state; 0 .. 2 ^^ 2)
    {
        auto ans = new char[](N);
        ans[0] = "SW"[state & 1];
        ans[1] = "SW"[(state >> 1) & 1];
        foreach (i; 1 .. N - 1)
        {
            if (ans[i - 1 .. i + 1] == "SS")
            {
                ans[i + 1] = (S[i] == 'o') ? 'S' : 'W';
            }
            if (ans[i - 1 .. i + 1] == "SW")
            {
                ans[i + 1] = (S[i] != 'o') ? 'S' : 'W';
            }
            if (ans[i - 1 .. i + 1] == "WS")
            {
                ans[i + 1] = (S[i] == 'o') ? 'W' : 'S';
            }
            if (ans[i - 1 .. i + 1] == "WW")
            {
                ans[i + 1] = (S[i] != 'o') ? 'W' : 'S';
            }
        }
        foreach (i; 0 .. N)
        {
            long l = (N + i - 1) % N;
            long r = (i + 1) % N;
            if (ans[i] == 'S' && S[i] == 'o' && ans[l] != ans[r])
                continue outer;
            if (ans[i] == 'S' && S[i] == 'x' && ans[l] == ans[r])
                continue outer;
            if (ans[i] == 'W' && S[i] == 'o' && ans[l] == ans[r])
                continue outer;
            if (ans[i] == 'W' && S[i] == 'x' && ans[l] != ans[r])
                continue outer;
        }
        writeln(ans);
        return;
    }
    writeln(-1);
}
