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
import java.util.Scanner;

public class Main{
  static int n;
  static boolean[] pat;

  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);

    n = sc.nextInt();
    pat = new boolean[n];
    String line = sc.next();
    for(int i = 0; i < line.length(); i++){
      pat[i] = (line.charAt(i) == 'o');
    }

    boolean[] ans = null;

    boolean[] ss = search(true, true);
    if(ss != null){
      System.out.println(toAnswer(ss));
      return;
    }

    boolean[] sw = search(true, false);
    if(sw != null){
      System.out.println(toAnswer(sw));
      return;
    }

    boolean[] ws = search(false, true);
    if(ws != null){
      System.out.println(toAnswer(ws));
      return;
    }

    boolean[] ww = search(false, false);
    if(ww != null){
      System.out.println(toAnswer(ww));
      return;
    }

    System.out.println(-1);
  }

  private static boolean[] search(boolean s0, boolean s1){
    boolean[] s = new boolean[n];
    s[0] = s0;  s[1] = s1;

    for(int i = 1; i < n - 1; i++){
      if(pat[i]){
        s[(i + 1) % n] = s[(i - 1 + n) % n];
      }
      else{
        s[(i + 1) % n] = !s[(i - 1 + n) % n];
      }
      if(!s[i]){
        s[(i + 1) % n] = !s[(i + 1) % n];
      }
    }

    if(pat[0]){
      if(s[0]){
        if(s[n - 1] != s[1]){
          return null;
        }
      }
      else{
        if(s[n - 1] == s[1]){
          return null;
        }
      }
    }
    else{
      if(s[0]){
        if(s[n - 1] == s[1]){
          return null;
        }
      }
      else{
        if(s[n - 1] != s[1]){
          return null;
        }
      }
    }

    if(pat[n - 1]){
      if(s[n - 1]){
        if(s[n - 2] != s[0]){
          return null;
        }
      }
      else{
        if(s[n - 2] == s[0]){
          return null;
        }
      }
    }
    else{
      if(s[n - 1]){
        if(s[n - 2] == s[0]){
          return null;
        }
      }
      else{
        if(s[n - 2] != s[0]){
          return null;
        }
      }
    }

    return s;
  }

  private static String toAnswer(boolean[] a){
    StringBuilder sb = new StringBuilder();
    for(int i = 0; i < a.length; i++){
      if(a[i]){
        sb.append("S");
      }
      else{
        sb.append("W");
      }
    }
    return sb.toString();
  }
}
