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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author GYSHGX868
 */
public class Main {
  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    InputReader in = new InputReader(inputStream);
    OutputWriter out = new OutputWriter(outputStream);
    TaskD solver = new TaskD();
    solver.solve(1, in, out);
    out.close();
  }

  static class TaskD {
    public void solve(int testNumber, InputReader in, OutputWriter out) {
      int n = in.nextInt();
      char[] s = in.nextString().toCharArray();
      char[] answer = new char[n];
      answer[0] = answer[1] = 'S';
      boolean solved = solveOne(answer, n, s);
      if (solved) {
        out.printLine(answer);
        return;
      }
      answer[0] = answer[1] = 'W';
      solved = solveOne(answer, n, s);
      if (solved) {
        out.printLine(answer);
        return;
      }
      answer[0] = 'S';
      answer[1] = 'W';
      solved = solveOne(answer, n, s);
      if (solved) {
        out.printLine(answer);
        return;
      }
      answer[0] = 'W';
      answer[1] = 'S';
      solved = solveOne(answer, n, s);
      if (solved) {
        out.printLine(answer);
      } else {
        out.printLine(-1);
      }
    }

    private boolean solveOne(char[] answer, int n, char[] s) {
      for (int i = 1; i < n - 1; i++) {
        if (answer[i] == 'S' && s[i] == 'o') {
          answer[i + 1] = answer[i - 1];
        }
        if (answer[i] == 'S' && s[i] == 'x') {
          answer[i + 1] = answer[i - 1] == 'W' ? 'S' : 'W';
        }
        if (answer[i] == 'W' && s[i] == 'o') {
          answer[i + 1] = answer[i - 1] == 'W' ? 'S' : 'W';
        }
        if (answer[i] == 'W' && s[i] == 'x') {
          answer[i + 1] = answer[i - 1];
        }
      }

      if (answer[n - 1] == 'S' && s[n - 1] == 'o') {
        return answer[0] == answer[n - 2] && judgeFirst(answer, n, s);
      }
      if (answer[n - 1] == 'S' && s[n - 1] == 'x') {
        return answer[0] != answer[n - 2] && judgeFirst(answer, n, s);
      }
      if (answer[n - 1] == 'W' && s[n - 1] == 'o') {
        return answer[0] != answer[n - 2] && judgeFirst(answer, n, s);
      }
      if (answer[n - 1] == 'W' && s[n - 1] == 'x') {
        return answer[0] == answer[n - 2] && judgeFirst(answer, n, s);
      }
      return false;
    }

    private boolean judgeFirst(char[] answer, int n, char[] s) {
      if (answer[0] == 'S' && s[0] == 'o') {
        return answer[n - 1] == answer[1];
      }
      if (answer[0] == 'S' && s[0] == 'x') {
        return answer[n - 1] != answer[1];
      }
      if (answer[0] == 'W' && s[0] == 'o') {
        return answer[n - 1] != answer[1];
      }
      if (answer[0] == 'W' && s[0] == 'x') {
        return answer[n - 1] == answer[1];
      }
      return false;
    }

  }

  static class InputReader {
    private InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;
    private InputReader.SpaceCharFilter filter;

    public InputReader(InputStream stream) {
      this.stream = stream;
    }

    public int read() {
      if (numChars == -1) {
        throw new InputMismatchException();
      }
      if (curChar >= numChars) {
        curChar = 0;
        try {
          numChars = stream.read(buf);
        } catch (IOException e) {
          throw new InputMismatchException();
        }
        if (numChars <= 0) {
          return -1;
        }
      }
      return buf[curChar++];
    }

    public int nextInt() {
      int c = read();
      while (isSpaceChar(c)) {
        c = read();
      }
      int sgn = 1;
      if (c == '-') {
        sgn = -1;
        c = read();
      }
      int res = 0;
      do {
        if (c < '0' || c > '9') {
          throw new InputMismatchException();
        }
        res *= 10;
        res += c - '0';
        c = read();
      } while (!isSpaceChar(c));
      return res * sgn;
    }

    public String nextString() {
      int c = read();
      while (isSpaceChar(c)) {
        c = read();
      }
      StringBuilder res = new StringBuilder();
      do {
        if (Character.isValidCodePoint(c)) {
          res.appendCodePoint(c);
        }
        c = read();
      } while (!isSpaceChar(c));
      return res.toString();
    }

    public boolean isSpaceChar(int c) {
      if (filter != null) {
        return filter.isSpaceChar(c);
      }
      return isWhitespace(c);
    }

    public static boolean isWhitespace(int c) {
      return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public interface SpaceCharFilter {
      boolean isSpaceChar(int ch);

    }

  }

  static class OutputWriter {
    private final PrintWriter writer;

    public OutputWriter(OutputStream outputStream) {
      writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
    }

    public OutputWriter(Writer writer) {
      this.writer = new PrintWriter(writer);
    }

    public void printLine(char[] array) {
      writer.println(array);
    }

    public void close() {
      writer.close();
    }

    public void printLine(int i) {
      writer.println(i);
    }

  }
}

