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 <iostream>
using namespace std;
#define M 100009

int N;
string s;
char ox[M];
char sw[M];

char inv(char c){
	return c == 'S' ? 'W' : 'S';
}
int main(){
	cin >> N >> s;
	for(int i=0; i<N; i++){
		ox[i] = s.at(i);
	}
	ox[N] = ox[0];
	ox[N+1] = ox[1];
	char init[2][4] = {
		{'S', 'S', 'W', 'W'},
		{'S', 'W', 'S', 'W'}
	};
	for(int I=0; I<4; I++){
		sw[0] = init[0][I];
		sw[1] = init[1][I];
		for(int i=2; i<=N+1; i++){
			sw[i] = (sw[i-1] == 'S')?(
					ox[i-1] == 'o' ? sw[i-2] : inv(sw[i-2])
				):(
					ox[i-1] == 'o' ? inv(sw[i-2]) : sw[i-2]
				);
		}
		if(sw[0] == sw[N] && sw[1] == sw[N+1]){
			for(int i=0; i<N; i++){
				cout << sw[i];
			}
			cout << endl;
			return 0;
		}
	}
	cout << -1 << endl;
	return 0;
}