#include<iostream>
using namespace std;
string s,ans;
int n;
char fir[]={'S','S','W','S'};
char sec[]={'S','W','S','W'};
int judge()
{
	for(int i=0;i<n;i++)
	{
		if(s[i]=='o')
		{
			if(ans[i]=='W')
			{
				if(ans[(i-1+n)%n]==ans[(i+1)%n])
				return 0;	
			}
			else
			{
				if(ans[(i-1+n)%n]!=ans[(i+1)%n])
				return 0;
			}
		}
		else
		{
			if(ans[i]=='W')
			{
				if(ans[(i-1+n)%n]!=ans[(i+1)%n])
				return 0;
			}
			else
			{
				if(ans[(i-1+n)%n]==ans[(i+1)%n])
				return 0;
			}
		}
	}
	return 1;
}
int main()
{
	cin>>n;
	cin>>s;	
	int flag=0;
	for(int k=0;k<4;k++)
	{
		ans[0]=fir[k];
		ans[1]=sec[k];
		for(int i=1;i<n;i++)
		{
			if(s[i]=='o')
			{
				if(ans[i]=='S')
				ans[(i+1)%n]=ans[(i-1+n)%n];
				else
				{
					if(ans[(i-1+n)%n]=='W')
					ans[(i+1)%n]='S';
					else
					ans[(i+1)%n]='W';
				}	
			}
			else
			{
				if(ans[i]=='S')
				{
					if(ans[(i-1+n)%n]=='S')
					ans[(i+1)%n]='W';
					else
					ans[(i+1)%n]='S';
				}
				else
				ans[(i+1)%n]=ans[(i-1+n)%n];
			}
		}
		if(judge()==1)
		{
			for(int i=0;i<n;i++)
			cout<<ans[i];
			cout<<endl;	
			flag=1;
		}
		if(flag)
		break;
	}
	if(flag==0)
	cout<<-1<<endl;
	return 0;
}