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 {
	static int N, ans[];
	static String s;
	static boolean out;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		s = sc.next();
		sc.close();
		ans = new int[N];
		//羊が0、狼は1
		for(int i=0;i<4;i++) {
			out = false;
			char firstChar = s.charAt(0); 
			Arrays.fill(ans, -1);
			if(i==0) {
				ans[N-1]=ans[0]=0;
			}
			else if(i==1) {
				ans[N-1]=0;ans[0]=1;
			}
			else if(i==2) {
				ans[N-1]=1;ans[0]=0;
			}
			else if(i==3) {
				ans[N-1]=ans[0]=1;
			}
			first_next(firstChar,0,N-1);
			
			for(int j=1;j<N-1;j++) {
				char now = s.charAt(j);
				next(now, j);
				if(out)break;
			}
			lastCheck(s.charAt(N-1),0,N-1);
			if(!out) {
				StringBuilder sb = new StringBuilder();
				for(int t : ans) {
					if(t==0)sb.append("S");
					else sb.append("W");
				}
				System.out.println(sb.toString());
				return;
			}
			

		}
		System.out.println(-1);	
	}
	static void next(char now, int center) {
		if(now=='o') {
			if(ans[center-1]==0&&ans[center]==0)if(!check(center+1, 0))return;
			if(ans[center-1]==0&&ans[center]==1)if(!check(center+1, 1))return;
			if(ans[center-1]==1&&ans[center]==0)if(!check(center+1, 1))return;
			if(ans[center-1]==1&&ans[center]==1)if(!check(center+1, 0))return;
		}else {
			if(ans[center-1]==0&&ans[center]==0)if(!check(center+1, 1))return;
			if(ans[center-1]==0&&ans[center]==1)if(!check(center+1, 0))return;
			if(ans[center-1]==1&&ans[center]==0)if(!check(center+1, 0))return;
			if(ans[center-1]==1&&ans[center]==1)if(!check(center+1, 1))return;
		}
	}
	static boolean check(int next, int z_o) {
		if(ans[next]!=-1&&ans[next]!=z_o) {
			out = true;
			return false;
		}
		ans[next]=z_o;
		return true;
	}
	
	static void first_next(char lastChar, int start, int last) {
		if(lastChar=='o') {
			if(ans[last]==0&&ans[start]==0)if(!check(start+1, 0))return;
			if(ans[last]==0&&ans[start]==1)if(!check(start+1, 1))return;
			if(ans[last]==1&&ans[start]==0)if(!check(start+1, 1))return;
			if(ans[last]==1&&ans[start]==1)if(!check(start+1, 0))return;
		}else {
			if(ans[last]==0&&ans[start]==0)if(!check(start+1, 1))return;
			if(ans[last]==0&&ans[start]==1)if(!check(start+1, 0))return;
			if(ans[last]==1&&ans[start]==0)if(!check(start+1, 0))return;
			if(ans[last]==1&&ans[start]==1)if(!check(start+1, 1))return;
		}
	}
	static void lastCheck(char now, int start, int last) {
		if(now=='o') {
			if(ans[last-1]==0&&ans[last]==0)if(!check(start, 0))return;
			if(ans[last-1]==0&&ans[last]==1)if(!check(start, 1))return;
			if(ans[last-1]==1&&ans[last]==0)if(!check(start, 1))return;
			if(ans[last-1]==1&&ans[last]==1)if(!check(start, 0))return;
		}else {
			if(ans[last-1]==0&&ans[last]==0)if(!check(start, 1))return;
			if(ans[last-1]==0&&ans[last]==1)if(!check(start, 0))return;
			if(ans[last-1]==1&&ans[last]==0)if(!check(start, 0))return;
			if(ans[last-1]==1&&ans[last]==1)if(!check(start, 1))return;
		}
	}
}
