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;
const int dir[4][2] = {{0,0},{0,1},{1,0},{1,1}};

int query(int left,int now,char c) {
  if(now==0) {
    return (c=='o')?left:(left+1)%2;
  }
  return (c=='x')?left:(left+1)%2;
}
string solve(int n,string s) {
  int arr[100001];
  for (int x=0; x<4; x++) {
    for (int i=0; i<n; i++) {
      arr[i]=(-1);
    }
    arr[0]=dir[x][0];
    arr[1]=dir[x][1];
    for (int i=2; i<n; i++) {
      arr[i]=query(arr[i-2],arr[i-1],s[i-1]);
    }
    if (arr[0]==query(arr[n-2],arr[n-1],s[n-1]) &&
        arr[1]==query(arr[n-1],arr[0],s[0])) {
      string t="";
      for (int i=0; i<n; i++) {
        t+=(arr[i]==0)?"S":"W";
      }
      return t;
    }
  }
  return "-1";
}
int main() {
  int N;
  string s;
  cin >> N >> s;
  cout << solve(N,s) << endl;
  return 0;
}

