#include<cstdio>
#include<string.h>
char s1[100010];
char s2[100010];
int n;
int main()
{
    int judge,a,finajudge;
    while(scanf("%d",&n)!=EOF)
    {
        judge=0;
        scanf("%s",s1+1);
        if(judge==0)
        {
          s2[1]='S',s2[2]='S';
            if(s1[1]=='o')
                s2[n]='S';
            else s2[n]='W';
            for(a=2; a<n-1; a++)
            {
                if(s2[a]=='S')
                {
                    if(s1[a]=='o')
                        s2[a+1]=s2[a-1];
                    else
                    {
                        if(s2[a-1]=='S')
                            s2[a+1]='W';
                        else s2[a+1]='S';
                    }
                }
                else
                {
                    if(s1[a]=='x')
                        s2[a+1]=s2[a-1];
                    else
                    {
                        if(s2[a-1]=='S')
                            s2[a+1]='W';
                        else s2[a+1]='S';
                    }
                }
            }
            finajudge=0;
            if(s2[n-1]=='S')
            {

                if(s1[n-1]=='o')
                {
                    if(s2[n-2]==s2[n])finajudge=1;
                }
                else
                {
                    if(s2[n-2]!=s2[n])finajudge=1;
                }
            }
            else
            {
                if(s1[n-1]=='o')
                {
                    if(s2[n-2]!=s2[n])finajudge=1;

                }
                else
                {
                    if(s2[n-2]==s2[n])finajudge=1;
                }
            }
            if(finajudge==1)
            {
                if(s2[n]=='S')
                {
                    if(s1[n]=='o')
                    {
                        if(s2[n-1]==s2[1])judge=1;
                    }
                    else
                    {
                        if(s2[n-1]!=s2[1])judge=1;
                    }
                }
                else
                {
                    if(s1[n]=='o')
                    {
                        if(s2[n-1]!=s2[1])judge=1;
                    }
                    else
                    {
                        if(s2[n-1]==s2[1])judge=1;
                    }
                }
            }
        }
        if(judge==0)
        {
           s2[1]='S',s2[2]='W';
            if(s1[1]=='o')s2[n]='W';
            else s2[n]='S';
            for(a=2; a<n-1; a++)
            {
                if(s2[a]=='S')
                {
                    if(s1[a]=='o')
                        s2[a+1]=s2[a-1];
                    else
                    {
                        if(s2[a-1]=='S')
                            s2[a+1]='W';
                        else s2[a+1]='S';
                    }
                }
                else
                {
                    if(s1[a]=='x')
                        s2[a+1]=s2[a-1];
                    else
                    {
                        if(s2[a-1]=='S')
                            s2[a+1]='W';
                        else s2[a+1]='S';
                    }
                }
            }
            finajudge=0;
            if(s2[n-1]=='S')
            {

                if(s1[n-1]=='o')
                {
                    if(s2[n-2]==s2[n])finajudge=1;
                }
                else
                {
                    if(s2[n-2]!=s2[n])finajudge=1;
                }
            }
            else
            {
                if(s1[n-1]=='o')
                {
                    if(s2[n-2]!=s2[n])finajudge=1;

                }
                else
                {
                    if(s2[n-2]==s2[n])finajudge=1;
                }
            }
            if(finajudge==1)
            {
                if(s2[n]=='S')
                {
                    if(s1[n]=='o')
                    {
                        if(s2[n-1]==s2[1])judge=1;
                    }
                    else
                    {
                        if(s2[n-1]!=s2[1])judge=1;
                    }
                }
                else
                {
                    if(s1[n]=='o')
                    {
                        if(s2[n-1]!=s2[1])judge=1;
                    }
                    else
                    {
                        if(s2[n-1]==s2[1])judge=1;
                    }
                }
            }
        }
        if(judge==0)
        {
         s2[1]='W',s2[2]='W';
            if(s1[1]=='o')
                s2[n]='S';
            else s2[n]='W';
            for(a=2; a<n-1; a++)
            {
                if(s2[a]=='S')
                {
                    if(s1[a]=='o')
                        s2[a+1]=s2[a-1];
                    else
                    {
                        if(s2[a-1]=='S')
                            s2[a+1]='W';
                        else s2[a+1]='S';
                    }
                }
                else
                {
                    if(s1[a]=='x')
                        s2[a+1]=s2[a-1];
                    else
                    {
                        if(s2[a-1]=='S')
                            s2[a+1]='W';
                        else s2[a+1]='S';
                    }
                }
            }
            finajudge=0;
            if(s2[n-1]=='S')
            {

                if(s1[n-1]=='o')
                {
                    if(s2[n-2]==s2[n])finajudge=1;
                }
                else
                {
                    if(s2[n-2]!=s2[n])finajudge=1;
                }
            }
            else
            {
                if(s1[n-1]=='o')
                {
                    if(s2[n-2]!=s2[n])finajudge=1;

                }
                else
                {
                    if(s2[n-2]==s2[n])finajudge=1;
                }
            }
            if(finajudge==1)
            {
                if(s2[n]=='S')
                {
                    if(s1[n]=='o')
                    {
                        if(s2[n-1]==s2[1])judge=1;
                    }
                    else
                    {
                        if(s2[n-1]!=s2[1])judge=1;
                    }
                }
                else
                {
                    if(s1[n]=='o')
                    {
                        if(s2[n-1]!=s2[1])judge=1;
                    }
                    else
                    {
                        if(s2[n-1]==s2[1])judge=1;
                    }
                }
            }
        }
        if(judge==0)
        {
         s2[1]='W',s2[2]='S';
            if(s1[1]=='o')
                s2[n]='W';
            else s2[n]='S';
            for(a=2; a<n-1; a++)
            {
                if(s2[a]=='S')
                {
                    if(s1[a]=='o')
                        s2[a+1]=s2[a-1];
                    else
                    {
                        if(s2[a-1]=='S')
                            s2[a+1]='W';
                        else s2[a+1]='S';
                    }
                }
                else
                {
                    if(s1[a]=='x')
                        s2[a+1]=s2[a-1];
                    else
                    {
                        if(s2[a-1]=='S')
                            s2[a+1]='W';
                        else s2[a+1]='S';
                    }
                }
            }
            finajudge=0;
            if(s2[n-1]=='S')
            {

                if(s1[n-1]=='o')
                {
                    if(s2[n-2]==s2[n])finajudge=1;
                }
                else
                {
                    if(s2[n-2]!=s2[n])finajudge=1;
                }
            }
            else
            {
                if(s1[n-1]=='o')
                {
                    if(s2[n-2]!=s2[n])finajudge=1;

                }
                else
                {
                    if(s2[n-2]==s2[n])finajudge=1;
                }
            }
            if(finajudge==1)
            {
                if(s2[n]=='S')
                {
                    if(s1[n]=='o')
                    {
                        if(s2[n-1]==s2[1])judge=1;
                    }
                    else
                    {
                        if(s2[n-1]!=s2[1])judge=1;
                    }
                }
                else
                {
                    if(s1[n]=='o')
                    {
                        if(s2[n-1]!=s2[1])judge=1;
                    }
                    else
                    {
                        if(s2[n-1]==s2[1])judge=1;
                    }
                }
            }
        }
        if(judge==1)
        {
            for(a=1;a<=n;a++)
                printf("%c",s2[a]);
            printf("\n");
        }
        else
            printf("-1\n");
    }
    return 0;
}


Measured memory_bytes: 512