#include<bits/stdc++.h>
using namespace std;
int n;
char str[100100];
int shp[100100];
char ys[2];
int main(){
	ys[0]='S';
	ys[1]='W';
	//freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
	cin>>n;
	scanf("%s",str);
	int tmp,yg;
	for(int i=0;i<4;i++){
		shp[0]=ys[i&1];
		shp[1]=ys[(i>>1)&1];
		for(int j=1;j<n-1;j++){
			tmp=str[j];
			if(shp[j]=='W')
				tmp='o'+'x'-tmp;
			if(tmp=='o')
				shp[j+1]=shp[j-1];
			else
				shp[j+1]='W'+'S'-shp[j-1];
		}
		tmp=str[n-1];
		if(shp[n-1]=='W')
			tmp='o'+'x'-tmp;
		if(tmp=='o')
			yg=shp[n-2];
		else
			yg='W'+'S'-shp[n-2];
		if(yg!=shp[0])
			continue;
		tmp=str[0];
		if(shp[0]=='W')
			tmp='o'+'x'-tmp;
		if(tmp=='o')
			yg=shp[n-1];
		else
			yg='W'+'S'-shp[n-1];
		if(yg!=shp[1])
			continue;
		for(int i=0;i<n;i++)
			cout<<(char)(shp[i]);
		cout<<endl;
		return 0;
	}
	puts("-1");
	return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
int n;
char str[100100];
int shp[100100];
char ys[2];
int main(){
	ys[0]='S';
	ys[1]='W';
	//freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
	cin>>n;
	scanf("%s",str);
	int tmp,yg;
	for(int i=0;i<4;i++){
		shp[0]=ys[i&1];
		shp[1]=ys[(i>>1)&1];
		for(int j=1;j<n-1;j++){
			tmp=str[j];
			if(shp[j]=='W')
				tmp='o'+'x'-tmp;
			if(tmp=='o')
				shp[j+1]=shp[j-1];
			else
				shp[j+1]='W'+'S'-shp[j-1];
		}
		tmp=str[n-1];
		if(shp[n-1]=='W')
			tmp='o'+'x'-tmp;
		if(tmp=='o')
			yg=shp[n-2];
		else
			yg='W'+'S'-shp[n-2];
		if(yg!=shp[0])
			continue;
		tmp=str[0];
		if(shp[0]=='W')
			tmp='o'+'x'-tmp;
		if(tmp=='o')
			yg=shp[n-1];
		else
			yg='W'+'S'-shp[n-1];
		if(yg!=shp[1])
			continue;
		for(int i=0;i<n;i++)
			cout<<(char)(shp[i]);
		cout<<endl;
		return 0;
	}
	puts("-1");
	return 0;
}

```