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
N = int(input())
S = input()

## 0:sheep, 1:wolf
first_state_circle = [[0,0,0],[0,1,1],[1,0,1],[1,1,0]] ## [1st,2nd,-1th]
first_state_cross = [[0,0,1],[0,1,0],[1,0,0],[1,1,1]] ## [1st,2nd,-1th]
transtable = str.maketrans({'0':'S', '1':'W'})

if S[0] == 'o':
  first_state = first_state_circle
else:
  first_state = first_state_cross

for state in first_state:
  lst = [-1]*N
  lst[0] = state[0]
  lst[1] = state[1]
  for i in range(1,N-1):
    lst[i+1] = (lst[i-1] + lst[i] + (S[i]=='x')) % 2
  #print(state,lst)
  if lst[N-1] != state[2]:
    continue
  if lst[0] != (lst[N-2] + lst[N-1] + (S[N-1]=='x')) % 2:
    continue
  ans = ''.join(map(str,lst)).translate(transtable)
  print(ans)
  exit()
else:
  print('-1')