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 <bits/stdc++.h>
using namespace std;
using ll = long long;

int N;
string S;

map<pair<char,string>, char> mp;

int main() {
	cin >> N >> S;
	S += S[0];
	// s[0]が'S'か'W'かと, S[1], S[N-1]が'S'か'W'かを決めたらあとは一意に定まる
	// 定まったS[N-1]が本来あるべきS[N-1]か確かめればいい
	vector<string>  cs;
	cs.push_back("SS");
	cs.push_back("SW");
	cs.push_back("WS");
	cs.push_back("WW");

	mp[make_pair('o',"SS")] = 'S';
	mp[make_pair('o',"WS")] = 'W';
	mp[make_pair('o',"SW")] = 'W';
	mp[make_pair('o',"WW")] = 'S';

	mp[make_pair('x',"SS")] = 'W';
	mp[make_pair('x',"WS")] = 'S';
	mp[make_pair('x',"SW")] = 'S';
	mp[make_pair('x',"WW")] = 'W';

	for(int i=2;i<=N+1;i++) {
		for(int j=0;j<cs.size();j++) {
			string tmp = "";
			tmp += cs[j][i-2];
			tmp += cs[j][i-1];
			cs[j] += mp[make_pair(S[i-1], tmp)];
		}
	}
	string ans = "-1";
	for(int i=0;i<cs.size();i++) {
		if(cs[i][0] == cs[i][N] and cs[i][1] == cs[i][N+1]) {
			cs[i].pop_back();
			cs[i].pop_back();
			ans = cs[i];
		}
	}
	cout << ans << endl;
}