#include <bits/stdc++.h>

using namespace std;
string str;
bool check(string chk){
    //cout<<str.length()<<endl;
    //cout<<chk<<endl;
    if(str[str.length() - 2] == 'o'){
        if(chk[str.length() - 2] == 'S' and chk[str.length() - 3] != chk[str.length() - 1])
            return false;
        else if(chk[str.length() - 2] == 'W' and chk[str.length() - 3] == chk[str.length() - 1])
            return false;
    }
    if(str[str.length() - 2] == 'x'){
        if(chk[str.length() - 2] == 'S' and chk[str.length() - 3] == chk[str.length() - 1])
            return false;
        else if(chk[str.length() - 2] == 'W' and chk[str.length() - 3] != chk[str.length() - 1])
            return false;
    }
    
    if(str[str.length() - 1] == 'o'){
        if(chk[str.length() - 1] == 'S' and chk[str.length() - 2] != chk[0])
            return false;
        else if(chk[str.length() - 1] == 'W' and chk[str.length() - 2] == chk[0])
            return false;
    }
    if(str[str.length() - 1] == 'x'){
        if(chk[str.length() - 1] == 'S' and chk[str.length() - 2] == chk[0])
            return false;
        else if(chk[str.length() - 1] == 'W' and chk[str.length() - 2] != chk[0])
            return false;
    }
    
    
    
    return true;
}
int main() {
    int n;
    cin>>n;
    cin>>str;
    assert (n >= 3);
    //cout<<str;
    char ans[4][100005];
    int x = 0,cnt;
    if(str[0] == 'o'){
    // assume first is sheep and given 'o', so sheep on both sides
        cnt = 1;
        ans[x][0]='S';
        ans[x][str.length()-1] = ans[x][1] = 'S';
    for(int i = 1; i < str.length() - 2; i++){
        if(ans[x][i] == 'S' and str[i] == 'o'){
            ans[x][i+1] = ans[x][i-1]; 
        }
        else if(ans[x][i] == 'W' and str[i] == 'x' ){
            ans[x][i+1] = ans[x][i-1];
        }
        else if(ans[x][i] == 'S' and str[i] == 'x' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else if(ans[x][i] == 'W' and str[i] == 'o' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else
            cnt = 0;
    }
    //cout<<ans[x]<<endl;
    if(check(ans[x]) and cnt){
        cout<<ans[x];
        return 0;
    }
    x++;
    cnt = 1;
    // assume first is sheep and given 'o', so wolf on both sides
        ans[x][0]='S';
        
        ans[x][str.length()-1] = ans[x][1] = 'W';
    for(int i = 1; i < str.length() - 2; i++){
        if(ans[x][i] == 'S' and str[i] == 'o'){
            ans[x][i+1] = ans[x][i-1]; 
        }
        else if(ans[x][i] == 'W' and str[i] == 'x' ){
            ans[x][i+1] = ans[x][i-1];
        }
        else if(ans[x][i] == 'S' and str[i] == 'x' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else if(ans[x][i] == 'W' and str[i] == 'o' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else
            cnt = 0;
    }
    if(check(ans[x]) and cnt){
        cout<<ans[x];
        return 0;
    }
    x++;
    cnt = 1;
    // assume first is wolf and given 'o', so sheep on L wolf on R
        ans[x][0]='W';
        ans[x][str.length()-1] = 'S';
        ans[x][1] = 'W';
    for(int i = 1; i < str.length() - 2; i++){
        if(ans[x][i] == 'S' and str[i] == 'o'){
            ans[x][i+1] = ans[x][i-1]; 
        }
        else if(ans[x][i] == 'W' and str[i] == 'x' ){
            ans[x][i+1] = ans[x][i-1];
        }
        else if(ans[x][i] == 'S' and str[i] == 'x' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else if(ans[x][i] == 'W' and str[i] == 'o' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else
            cnt = 0;
    }
    if(check(ans[x]) and cnt){
        cout<<ans[x];
        return 0;
    }
    x++;
    cnt = 1;
    
    // assume first is wolf and given 'o', so sheep R wolf on L
        ans[x][0]='W';
        ans[x][str.length()-1] = 'W';
        ans[x][1] = 'S';
    for(int i = 1; i < str.length() - 2; i++){
        if(ans[x][i] == 'S' and str[i] == 'o'){
            ans[x][i+1] = ans[x][i-1]; 
        }
        else if(ans[x][i] == 'W' and str[i] == 'x' ){
            ans[x][i+1] = ans[x][i-1];
        }
        else if(ans[x][i] == 'S' and str[i] == 'x' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else if(ans[x][i] == 'W' and str[i] == 'o' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else
            cnt = 0;
    }
    if(check(ans[x]) and cnt){
        cout<<ans[x];
        return 0;
    }
    x++;
    }
    else{
        // assume first is wolf and given 'x', so sheep on both sides
        x = 0;
        cnt = 1;
        ans[x][0]='W';
        ans[x][str.length()-1] = ans[x][1] = 'S';
    for(int i = 1; i < str.length() - 2; i++){
        if(ans[x][i] == 'S' and str[i] == 'o'){
            ans[x][i+1] = ans[x][i-1]; 
        }
        else if(ans[x][i] == 'W' and str[i] == 'x' ){
            ans[x][i+1] = ans[x][i-1];
        }
        else if(ans[x][i] == 'S' and str[i] == 'x' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else if(ans[x][i] == 'W' and str[i] == 'o' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else
            cnt = 0;
    }
    //cout<<ans[x]<<endl;
    if(check(ans[x]) and cnt){
        cout<<ans[x];
        return 0;
    }
    x++;
    cnt = 1;
    // assume first is wolf and given 'x', so wolf on both sides
        ans[x][0]='W';
        ans[x][str.length()-1] = ans[x][1] = 'W';
    for(int i = 1; i < str.length() - 2; i++){
        if(ans[x][i] == 'S' and str[i] == 'o'){
            ans[x][i+1] = ans[x][i-1]; 
        }
        else if(ans[x][i] == 'W' and str[i] == 'x' ){
            ans[x][i+1] = ans[x][i-1];
        }
        else if(ans[x][i] == 'S' and str[i] == 'x' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else if(ans[x][i] == 'W' and str[i] == 'o' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else
            cnt = 0;
    }
    if(check(ans[x]) and cnt){
        cout<<ans[x];
        return 0;
    }
    x++;
    cnt = 1;
    // assume first is sheep and given 'x', so sheep on L wolf on R
        ans[x][0]='S';
        ans[x][str.length()-1] = 'S';
        ans[x][1] = 'W';
    for(int i = 1; i < str.length() - 2; i++){
        if(ans[x][i] == 'S' and str[i] == 'o'){
            ans[x][i+1] = ans[x][i-1]; 
        }
        else if(ans[x][i] == 'W' and str[i] == 'x' ){
            ans[x][i+1] = ans[x][i-1];
        }
        else if(ans[x][i] == 'S' and str[i] == 'x' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else if(ans[x][i] == 'W' and str[i] == 'o' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else
            cnt = 0;
    }
    if(check(ans[x]) and cnt){
        cout<<ans[x];
        return 0;
    }
    x++;
    cnt = 1;
    
    // assume first is sheep and given 'x', so sheep R wolf on L
        ans[x][0]='S';
        ans[x][str.length()-1] = 'W';
        ans[x][1] = 'S';
    for(int i = 1; i < str.length() - 2; i++){
        if(ans[x][i] == 'S' and str[i] == 'o'){
            ans[x][i+1] = ans[x][i-1]; 
        }
        else if(ans[x][i] == 'W' and str[i] == 'x' ){
            ans[x][i+1] = ans[x][i-1];
        }
        else if(ans[x][i] == 'S' and str[i] == 'x' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else if(ans[x][i] == 'W' and str[i] == 'o' ){
            ans[x][i+1] = (ans[x][i-1] == 'S' ? 'W' : 'S');
        }
        else
            cnt = 0;
    }
    //cout<<ans[x];
    if(check(ans[x]) and cnt){
        cout<<ans[x];
        return 0;
    }
    x++;
    }
    cout<<-1;
    
    
    
}

Measured memory_bytes: 924