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 {	
	
	private static int[] values = new int[100010];
	private static final int WOLF = 0 , SHEEP = 1;
	// o sheep both same
	// x wolf both same
	
	public static void main(String[] args) {
		
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		String input = scan.next() , ans = null;
		
		for (int i = 0;i < 2;i ++) {
			for (int j = 0;j < 2;j ++) {
				String temp = check(input , i , j);
				if (temp != null) {
					ans = temp;
					break;
				}
				if (ans != null)
					break;
			}	
		}
		if (ans == null)
			System.out.println(- 1);
		else
			System.out.println(ans);
		
	}
	
	private static int getValue(int current , int value , char ch) {
		
		if (current == WOLF) {
			if (ch == 'x') {
				return value;
			} else {
				return 1 - value;
			}
		} else {
			if (ch == 'o') {
				return value;
			} else {
				return 1 - value;
			}
		}
		
	}
	
	private static boolean check(int current , int left , int right , char ch) {
	
		if (current == WOLF) {
			if (ch == 'x') {
				if (left != right)
					return false;
			} else {
				if (left == right)
					return false;
			}
		} else {
			if (ch == 'o') {
				if (left != right)
					return false;
			} else {
				if (left == right)
					return false;
			}
		}
		return true;
		 
	}
	
	private static String check(String input , int value1 , int value2) {
		
		values[0] = value1;
		values[1] = value2;
		for (int i = 2;i < input.length();i ++) {
			values[i] = getValue(values[i - 1] , values[i - 2] , input.charAt(i - 1));
		}
		int length = input.length();
		for (int i = 0;i < length;i ++) {
			int left = (i == 0) ? (length - 1) : i - 1;
			int right = (i == length - 1) ? 0 : i + 1;
			char ch = input.charAt(i);
			if (!check(values[i] , values[left] , values[right] , ch)) {
				return null;
			}
		}
		StringBuilder builder = new StringBuilder();
		for (int i = 0;i < length;i ++) {
			if (values[i] == WOLF)
				builder.append("W");
			else
				builder.append("S");
		}
		return builder.toString();
		
	}
	
		
}












