/***                                                                    
 *            .,,       .,:;;iiiiiiiii;;:,,.     .,,                   
 *          rGB##HS,.;iirrrrriiiiiiiiiirrrrri;,s&##MAS,                
 *         r5s;:r3AH5iiiii;;;;;;;;;;;;;;;;iiirXHGSsiih1,               
 *            .;i;;s91;;;;;;::::::::::::;;;;iS5;;;ii:                  
 *          :rsriii;;r::::::::::::::::::::::;;,;;iiirsi,               
 *       .,iri;;::::;;;;;;::,,,,,,,,,,,,,..,,;;;;;;;;iiri,,.           
 *    ,9BM&,WA了活该       .,:;;:,,,,,,,,,,,hXA8:   T了天命..,,,.       
 *   ,;&@@#r:;;;;;::::,,.   ,r,,,,,,,,,,iA@@@s,,:::;;;::,,.   .;.      
 *    :ih1iii;;;;;::::;;;;;;;:,,,,,,,,,,;i55r;;;;;;;;;iiirrrr,..       
 *   .ir;;iiiiiiiiii;;;;::::::,,,,,,,:::::,,:;;;iiiiiiiiiiiiri         
 *   iriiiiiiiiiiiiiiii;;;::::::::::::::::;;;iiiiiiiiiiiiiiiir;        
 *  ,riii;;;;;;;;;;;;;:::::::::::::::::::::::;;;;;;;;;;;;;;iiir.       
 *  iri;;;::::,,,,,,,,,,:::::::::::::::::::::::::,::,,::::;;iir:       
 * .rii;;::::,,,,,,,,,,,,:::::::::::::::::,,,,,,,,,,,,,::::;;iri       
 * ,rii;;;::,,,,,,,,,,,,,:::::::::::,:::::,,,,,,,,,,,,,:::;;;iir.      
 * ,rii;;i::,,,,,,,,,,,,,:::::::::::::::::,,,,,,,,,,,,,,::i;;iir.      
 * ,rii;;r::,,,,,,,,,,,,,:,:::::,:,:::::::,,,,,,,,,,,,,::;r;;iir.      
 * .rii;;rr,:,,,,,,,,,,,,,,:::::::::::::::,,,,,,,,,,,,,:,si;;iri       
 *  ;rii;:1i,,,,,,,,,,,,,,,,,,:::::::::,,,,,,,,,,,,,,,:,ss:;iir:       
 *  .rii;;;5r,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,sh:;;iri        
 *   ;rii;:;51,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,.:hh:;;iir,        
 *    irii;::hSr,.,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,.,sSs:;;iir:         
 *     irii;;:iSSs:.,,,,,,,,,,,,,,,,,,,,,,,,,,,..:135;:;;iir:          
 *      ;rii;;:,r535r:...,,,,,,,,,,,,,,,,,,..,;sS35i,;;iirr:           
 *       :rrii;;:,;1S3Shs;:,............,:is533Ss:,;;;iiri,            
 *        .;rrii;;;:,;rhS393S55hh11hh5S3393Shr:,:;;;iirr:              
 *          .;rriii;;;::,:;is1h555555h1si;:,::;;;iirri:.               
 *            .:irrrii;;;;;:::,,,,,,,,:::;;;;iiirrr;,                  
 *               .:irrrriiiiii;;;;;;;;iiiiiirrrr;,.                    
 *                  .,:;iirrrrrrrrrrrrrrrrri;:.                        
 *                        ..,:::;;;;:::,,.                             
 */  
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<vector> 
using namespace std;
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mem(a,b) memset(a,b,sizeof(a));
#define lowbit(x)  x&-x;  
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-6;
const int maxn = 1e5+5;
const int mod = 1e9+7;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
char s[maxn];
int n;
int flag;
int ans[maxn]; //0 羊 1 狼
int judge(int kind,int id){
	if(kind){
		if(id == n){
			if(s[id] == 'o'){
				if(ans[id-1] != ans[1])
					return 1;
				else return 0;
			}else{
				if(ans[id-1] == ans[1])
					return 1;
				else return 0;
			}
		}
		else if(id == 1){
			if(s[id] == 'o'){
				if(ans[n] != ans[id+1])
					return 1;
				else return 0;
			}else{
				if(ans[n] == ans[id+1])
					return 1;
				else return 0;
			}
		}	
	}else{
		if(id == n){
			if(s[id] == 'o'){
				if(ans[id-1] == ans[1])
					return 1;
				else return 0;
			}else{
				if(ans[id-1] != ans[1])
					return 1;
				else return 0;
			}
		}
		else if(id == 1){
			if(s[id] == 'o'){
				if(ans[n] == ans[id+1])
					return 1;
				else return 0;
			}else{
				if(ans[n] != ans[id+1])
					return 1;
				else return 0;
			}
		}	
	}
}
void dfs(int pos, int kind){
	if(pos > n){
		return ;
	}
	if(flag) return ;
	ans[pos] = kind;
	if(pos == n){
		if(judge(kind,n) && judge(ans[1],1)){
			flag = 1;
			return ;
		}
	}
	if(kind){ //当前为狼
		if(s[pos] == 'o'){ //左右两边种类不同
			dfs(pos+1, ans[pos-1]^1);
		}else{
			dfs(pos+1, ans[pos-1]);
		}
	}else{
		if(s[pos] == 'o'){
			dfs(pos+1, ans[pos-1]);
		}else{
			dfs(pos+1, ans[pos-1]^1);
		}
	}
}
int main() {
	while(cin>>n){
		scanf("%s",s+1);
		flag = 0;
		mem(ans,0);
		//第一种情况  羊狼
		ans[1] = 0;
		dfs(2,1);
		if(!flag){
			mem(ans,0);
		//第二种 羊羊
			ans[1] = 0;
			dfs(2,0);
		}
		if(!flag){
			mem(ans,0);
			//第三种 狼羊
			ans[1] = 1;
			dfs(2,0);
		}
		if(!flag){
			mem(ans,0);
			//第四种 狼狼
			ans[1] = 1;
			dfs(2,1);
		}
		if(!flag) puts("-1");
		else{
			for(int i = 1; i <= n; i++){
				if(ans[i])
					printf("W");
				else
					printf("S");
			}
			puts("");
		}
	}
}


Measured memory_bytes: 768