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;

#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1000000007

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

int n;
string s;
vector<bool> sheep(100002), judge(100002);

bool solve(int x, int y) {
	FOR(k, 2, n) sheep[k] = (sheep[k - 1] ^ (s[k - 1] == 'o')) ? sheep[k - 2] : 1 - sheep[k - 2];
	if ((sheep[n-2] ^ (sheep[0]) ^ (sheep[n-1]) ^ (s[n-1] == 'x'))) return false;
    if ((sheep[n-1] ^ sheep[1]) ^ (sheep[0] ^ (s[0] == 'x'))) return false;
    return true;
}

int main() {
	cin >> n >> s;
	rep(i, n) judge[i] = s[i] == 'o';
	s[n] = s[0];
	rep(i, 2) rep(j, 2) {
		sheep[0] = i;
		sheep[1] = j;
		if(solve(i, j)) {
			rep(k, n) printf("%c", (sheep[k]) ? 'W' : 'S');
			printf("\n");
			return 0;
		}
	}
	printf("-1\n");
	return 0;
} 