#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int

#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;

namespace std {
    bool operator<(const P& a, const P& b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

signed main() {
    int n; string s;
    cin >> n >> s;
    int ws[100010][4];
    memset(ws, -1, sizeof(ws));
    // 0 ... sheep, 1 ... wolf
    ws[0][0] = 0, ws[0][1] = 0, ws[0][2] = 1, ws[0][3] = 1;
    ws[1][0] = 0, ws[1][1] = 1, ws[1][2] = 0, ws[1][3] = 1;
    rep(j,0,4) {
        rep(i,1,n) {
            if(i != n-1) {
                if(s[i] == 'o') {
                    // sheep
                    if(ws[i][j] == 0) {
                        ws[i+1][j] = ws[i-1][j];
                    }
                    // wolf
                    else {
                        ws[i+1][j] = 1 - ws[i-1][j];
                    }
                }
                else {
                    // sheep
                    if(ws[i][j] == 0) {
                        ws[i+1][j] = 1 - ws[i-1][j];
                    }
                    // wolf
                    else {
                        ws[i+1][j] = ws[i-1][j];
                    }
                }
            }
            else {
                if(s[i] == 'o') {
                    // sheep
                    if(ws[i][j] == 0) {
                        if(ws[0][j] != ws[i-1][j]) ws[0][j] = -1;
                    }
                    // wolf
                    else {
                        if(ws[0][j] == ws[i-1][j]) ws[0][j] = -1;
                    }
                }
                else {
                    // sheep
                    if(ws[i][j] == 0) {
                        if(ws[0][j] == ws[i-1][j]) ws[0][j] = -1;
                    }
                    // wolf
                    else {
                        if(ws[0][j] != ws[i-1][j]) ws[0][j] = -1;
                    }
                }
            }
        }
    }

    rep(i,0,4) {
        if(ws[0][i] == -1) continue;
        else {
            if(ws[0][i] == 0) {
                if(s[0] == 'o' && ws[1][i] != ws[n-1][i]) continue;
                if(s[0] == 'x' && ws[1][i] == ws[n-1][i]) continue;
            }
            if(ws[0][i] == 1) {
                if(s[0] == 'o' && ws[1][i] == ws[n-1][i]) continue;
                if(s[0] == 'x' && ws[1][i] != ws[n-1][i]) continue;
            }

            rep(j,0,n) {
                if(ws[j][i]) cout << "W";
                else cout << "S";
            }
            cout << endl;
            return 0;
        }
    }
    cout << -1 << endl;
    return 0;
}

Measured memory_bytes: 3712