Snuke, who loves animals, built a zoo.

There are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle. The animal numbered i (2≤i≤N-1) is adjacent to the animals numbered i-1 and i+1. Also, the animal numbered 1 is adjacent to the animals numbered 2 and N, and the animal numbered N is adjacent to the animals numbered N-1 and 1.

There are two kinds of animals in this zoo: honest sheep that only speak the truth, and lying wolves that only tell lies.

Snuke cannot tell the difference between these two species, and asked each animal the following question: "Are your neighbors of the same species?" The animal numbered i answered s_i. Here, if s_i is `o`, the animal said that the two neighboring animals are of the same species, and if s_i is `x`, the animal said that the two neighboring animals are of different species.

More formally, a sheep answered `o` if the two neighboring animals are both sheep or both wolves, and answered `x` otherwise. Similarly, a wolf answered `x` if the two neighboring animals are both sheep or both wolves, and answered `o` otherwise.

Snuke is wondering whether there is a valid assignment of species to the animals that is consistent with these responses. If there is such an assignment, show one such assignment. Otherwise, print `-1`.

Constraints

* 3 ≤ N ≤ 10^{5}
* s is a string of length N consisting of `o` and `x`.

Input

The input is given from Standard Input in the following format:


N
s


Output

If there does not exist an valid assignment that is consistent with s, print `-1`. Otherwise, print an string t in the following format. The output is considered correct if the assignment described by t is consistent with s.

* t is a string of length N consisting of `S` and `W`.
* If t_i is `S`, it indicates that the animal numbered i is a sheep. If t_i is `W`, it indicates that the animal numbered i is a wolf.

Examples

Input

6
ooxoox


Output

SSSWWS


Input

3
oox


Output

-1


Input

10
oxooxoxoox


Output

SSWWSSSWWS
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
using namespace std;

int n,lr[100005],put[100005];
char c[100005];
//0-->S 1-->W
void print(){
	for(int i=1;i<=n;i++)
	if(put[i]==0)printf("S");
	else printf("W");
}

void work(int num1,int num2){
	memset(put,0,sizeof(put));
	put[1]=num1;
	put[2]=num2;
	for(int i=2;i<=n;i++){
		if((c[i]=='x'&&put[i]==1)||(c[i]=='o'&&put[i]==0))
		put[i+1]=put[i-1];
		if((c[i]=='o'&&put[i]==1)||(c[i]=='x'&&put[i]==0))
		put[i+1]=1-put[i-1];
	}
	if(((c[1]=='x'&&put[1]==1)||(c[1]=='o'&&put[1]==0))&&put[2]==put[n]&&put[n+1]==put[1]){
		print();
		exit(0);
	}
	if(((c[1]=='o'&&put[1]==1)||(c[1]=='x'&&put[1]==0))&&put[2]+put[n]==1&&put[n+1]==put[1]){
		print();
		exit(0);
	}
}

int main(void){
	scanf("%d",&n);
	scanf("%s",c+1);
	for(int i=0;i<=1;i++){
		for(int j=0;j<=1;j++){
			work(i,j);
		}
	} 
	printf("-1");
}
