#include<iostream>
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<queue>
#include<string.h>
#include<cstring>
#include<vector>
#include<time.h>
#include<stdlib.h>
using namespace std;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
#define FIN freopen("input.txt","r",stdin)
#define mem(x,y) memset(x,y,sizeof(x))
typedef unsigned long long ULL;
typedef long long LL;
#define MX 1111111
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef pair<pair<int,int>,int> PIII;
typedef pair<int,int> PII;
int n;
char s[MX],ss[MX],p[2]= {'S','W'};
bool check(char *ss)
{
    for(int i=0; i<2; i++)
        for(int j=0; j<2; j++)
        {
            ss[0]=p[i];
            ss[1]=p[j];
            for(int k=1; k<n-1; k++)
            {
                if(ss[k]=='S')
                {
                    if(s[k]=='o')
                    {
                        if(ss[k-1]=='S')ss[k+1]='S';
                        else ss[k+1]='W';
                    }
                    else
                    {
                        if(ss[k-1]=='S')ss[k+1]='W';
                        else ss[k+1]='S';
                    }
                }
                else
                {
                    if(s[k]=='o')
                    {
                        if(ss[k-1]=='S')ss[k+1]='W';
                        else ss[k+1]='S';
                    }
                    else
                    {
                        if(ss[k-1]=='S')ss[k+1]='S';
                        else ss[k+1]='W';
                    }
                }

            }
            if(ss[n-1]=='S')
            {
                if(s[n-1]=='o')
                {
                    if(ss[n-2]==ss[0])return 1;
                }
                else
                {
                    if(ss[n-2]!=ss[0])return 1;
                }
            }
            else
            {
                if(s[n-1]=='o')
                {
                    if(ss[n-2]!=ss[0])return 1;
                }
                else
                {
                    if(ss[n-2]==ss[0])return 1;
                }
            }
        }
    return 0;
}
int main()
{
    while(~scanf("%d",&n))
    {
        scanf("%s",&s);
        if(check(ss)) printf("%s\n",ss);
        else puts("-1");

    }
    return 0;
}
