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.*;

public class Main {

	private static final char SHEEP = 'S';
	private static final char WOLF = 'W';

	private static final char SAME = 'o';
	private static final char DIFF = 'x';

	public static void main(String[] args) {
		new Main().execute();
	}

	public void execute() {
		Scanner sc = new Scanner(System.in);
		final int N = sc.nextInt();
		final String S = sc.next();

		String ans = null;
		final char[] animals = { SHEEP, WOLF };
		for (int i = 0; i < animals.length; i++) {
			for (int j = 0; j < animals.length; j++) {
				ans = zoo(S, animals[i], animals[j]);
				if (ans != null) {
					System.out.println(ans);
					return;
				}
			}
		}
		System.out.println(-1);
		sc.close();
	}

	private String zoo(String s, char firstAnimal, char secondAnimal) {
		int len = s.length();
		char[] zoo = new char[len];
		zoo[0] = firstAnimal;
		zoo[1] = secondAnimal;
		char expectedZooN = nextAnimal(s.charAt(0), firstAnimal, secondAnimal);

		for (int i = 2; i < s.length(); i++) {
			zoo[i] = nextAnimal(s.charAt(i - 1), zoo[i - 1], zoo[i - 2]);
		}

		if (zoo[len - 1] == expectedZooN && nextAnimal(s.charAt(len - 1), zoo[len - 1], zoo[len - 2]) == zoo[0]) {
			return String.valueOf(zoo);
		} else {
			return null;
		}

	}

	private char other(char animal) {
		switch (animal) {
		case SHEEP:
			return WOLF;
		case WOLF:
			return SHEEP;
		default:
			throw new IllegalArgumentException();
		}
	}

	private char nextAnimal(char msg, char animal, char prevAnimal) {
		switch (animal) {
		case SHEEP:
			if (msg == SAME) {
				return prevAnimal;
			} else if (msg == DIFF) {
				return other(prevAnimal);
			} else {
				throw new IllegalArgumentException();
			}
		case WOLF:
			if (msg == SAME) {
				return other(prevAnimal);
			} else if (msg == DIFF) {
				return prevAnimal;
			} else {
				throw new IllegalArgumentException();
			}
		default:
			throw new IllegalArgumentException();
		}
	}

}