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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {
		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt();
			char[] s = in.nextString().toCharArray();

			// 1
			char[] ans = new char[n];
			if (s[0] == 'o') {
				ans = new char[n];
				ans[(n-1)%n] = 'S';
				ans[(n+0)%n] = 'S';
				ans[(n+1)%n] = 'S';

				for (int i = 1; i < n; i++) {
					if (ans[i] == 'S' && s[i] == 'o') {
						ans[(i + 1)%n] = ans[i-1];
					} else if (ans[i] == 'S' && s[i] == 'x') {
						ans[(i + 1)%n] = other(ans[i-1]);
					} else if (ans[i] == 'W' && s[i] == 'o') {
						ans[(i + 1)%n] = other(ans[i-1]);
					} else if (ans[i] == 'W' && s[i] == 'x') {
						ans[(i + 1)%n] = ans[i-1];
					}
				}
				if (ans[(n-1)%n] == 'S' && ans[(n+0)%n] == 'S' && ans[(n+1)%n] == 'S') {
					out.println(new String(ans));
					return;
				}

				// 2
				ans = new char[n];
				ans[(n - 1) % n] = 'W';
				ans[(n + 0) % n] = 'S';
				ans[(n + 1) % n] = 'W';

				for (int i = 1; i < n; i++) {
					if (ans[i] == 'S' && s[i] == 'o') {
						ans[(i + 1)%n] = ans[i - 1];
					} else if (ans[i] == 'S' && s[i] == 'x') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'o') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'x') {
						ans[(i + 1)%n] = ans[i - 1];
					}
				}
				if (ans[(n-1)%n] == 'W' && ans[(n+0)%n] == 'S' && ans[(n+1)%n] == 'W') {
					out.println(new String(ans));
					return;
				}
				// 3
				ans = new char[n];
				ans[(n - 1) % n] = 'W';
				ans[(n + 0) % n] = 'W';
				ans[(n + 1) % n] = 'S';

				for (int i = 1; i < n; i++) {
					if (ans[i] == 'S' && s[i] == 'o') {
						ans[(i + 1)%n] = ans[i - 1];
					} else if (ans[i] == 'S' && s[i] == 'x') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'o') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'x') {
						ans[(i + 1)%n] = ans[i - 1];
					}
				}
				if (ans[(n-1)%n] == 'W' && ans[(n+0)%n] == 'W' && ans[(n+1)%n] == 'S') {
					out.println(new String(ans));
					return;
				}

				// 4
				ans = new char[n];
				ans[(n - 1) % n] = 'S';
				ans[(n + 0) % n] = 'W';
				ans[(n + 1) % n] = 'W';

				for (int i = 1; i < n; i++) {
					if (ans[i] == 'S' && s[i] == 'o') {
						ans[(i + 1)%n] = ans[i - 1];
					} else if (ans[i] == 'S' && s[i] == 'x') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'o') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'x') {
						ans[(i + 1)%n] = ans[i - 1];
					}
				}
				if (ans[(n-1)%n] == 'S' && ans[(n+0)%n] == 'W' && ans[(n+1)%n] == 'W') {
					out.println(new String(ans));
					return;
				}
			} else {
				ans = new char[n];
				ans[(n-1)%n] = 'W';
				ans[(n+0)%n] = 'S';
				ans[(n+1)%n] = 'S';

				for (int i = 1; i < n; i++) {
					if (ans[i] == 'S' && s[i] == 'o') {
						ans[(i + 1)%n] = ans[i-1];
					} else if (ans[i] == 'S' && s[i] == 'x') {
						ans[(i + 1)%n] = other(ans[i-1]);
					} else if (ans[i] == 'W' && s[i] == 'o') {
						ans[(i + 1)%n] = other(ans[i-1]);
					} else if (ans[i] == 'W' && s[i] == 'x') {
						ans[(i + 1)%n] = ans[i-1];
					}
				}
				if (ans[(n-1)%n] == 'W' && ans[(n+0)%n] == 'S' && ans[(n+1)%n] == 'S') {
					out.println(new String(ans));
					return;
				}

				// 2
				ans = new char[n];
				ans[(n - 1) % n] = 'S';
				ans[(n + 0) % n] = 'S';
				ans[(n + 1) % n] = 'W';

				for (int i = 1; i < n; i++) {
					if (ans[i] == 'S' && s[i] == 'o') {
						ans[(i + 1)%n] = ans[i - 1];
					} else if (ans[i] == 'S' && s[i] == 'x') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'o') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'x') {
						ans[(i + 1)%n] = ans[i - 1];
					}
				}
				if (ans[(n-1)%n] == 'S' && ans[(n+0)%n] == 'S' && ans[(n+1)%n] == 'W') {
					out.println(new String(ans));
					return;
				}
				// 3
				ans = new char[n];
				ans[(n - 1) % n] = 'W';
				ans[(n + 0) % n] = 'W';
				ans[(n + 1) % n] = 'W';

				for (int i = 1; i < n; i++) {
					if (ans[i] == 'S' && s[i] == 'o') {
						ans[(i + 1)%n] = ans[i - 1];
					} else if (ans[i] == 'S' && s[i] == 'x') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'o') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'x') {
						ans[(i + 1)%n] = ans[i - 1];
					}
				}
				if (ans[(n-1)%n] == 'W' && ans[(n+0)%n] == 'W' && ans[(n+1)%n] == 'W') {
					out.println(new String(ans));
					return;
				}

				// 4
				ans = new char[n];
				ans[(n - 1) % n] = 'S';
				ans[(n + 0) % n] = 'W';
				ans[(n + 1) % n] = 'S';

				for (int i = 1; i < n; i++) {
					if (ans[i] == 'S' && s[i] == 'o') {
						ans[(i + 1)%n] = ans[i - 1];
					} else if (ans[i] == 'S' && s[i] == 'x') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'o') {
						ans[(i + 1)%n] = other(ans[i - 1]);
					} else if (ans[i] == 'W' && s[i] == 'x') {
						ans[(i + 1)%n] = ans[i - 1];
					}
				}
				if (ans[(n-1)%n] == 'S' && ans[(n+0)%n] == 'W' && ans[(n+1)%n] == 'S') {
					out.println(new String(ans));
					return;
				}
			}


			out.println(-1);
		}

		static char other(char a) {
			return a == 'S' ? 'W' : 'S';
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}

	}

}
