#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define rep(i,j,k) for (int i=j;i<=k;++i)
const int N=1e5+100;
char s[N];
int a[N];
bool check(int n)
{
	for (int i=2;i<n;++i) 
	{
		if (a[i]==1) 
		{
			if (s[i]=='o') a[i+1]=a[i-1];
			else a[i+1]=1-a[i-1];
		}
		else 
		{
			if (s[i]=='o') a[i+1]=1-a[i];
			else a[i+1]=a[i];
		}
	}
	if (a[1]) 
	{
		if (s[1]=='o'&&a[2]!=a[n])  return 0;
 		if (s[1]=='x'&&a[2]==a[n]) return 0;
 	}
 	else 
 	{
 		if (s[1]=='o'&&a[2]==a[n]) return 0;
 		if (s[1]=='x'&&a[2]!=a[n]) return 0;
 	}
 	if (a[n])
 	{
 		if (s[n]=='o'&&a[n-1]!=a[1]) return 0;
 		if (s[n]=='x'&&a[n-1]==a[1]) return 0;
 	}
 	else 
 	{
 		if (s[n]=='o'&&a[n-1]==a[1]) return 0;
 		if (s[n]=='x'&&a[n-1]!=a[1]) return 0;
 	}
 	return 1;
}
void print(int n)
{
	for (int i=1;i<=n;++i) if (a[i]) printf("S"); else printf("W");
	printf("\n");
}
void solve(int n)
{
	rep(i,0,1) 
	{
		a[1]=i;
		rep(j,0,1)
		{
			a[2]=j;
			if (check(n))
			{
				print(n); return;
			}
		}
	}
	puts("-1");
}
int main(int argc, char const *argv[])
{
	int n;
	while (scanf("%d%s",&n,s+1)!=-1) solve(n);
	return 0;
}