import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		main.out.close();
	}

	// ======================================================================
	final char SAME = 'o';
	final char SHEEP = 'S';
	final char WOLF = 'W';
	public void solve() {
		int N = ni();
		char[] C = ns().toCharArray();
		char[] ans = new char[N];
		boolean f;
		for (int i = 0; i < 4; i++) {
			Arrays.fill(ans, ' ');
			if(i == 0) {
				ans[0] = SHEEP;
				if(C[0] == SAME) {	ans[N-1] = SHEEP;		ans[1] = SHEEP;
				} else {			ans[N-1] = SHEEP;		ans[1] = WOLF;	}
			} else if(i == 1) {
				ans[0] = SHEEP;
				if(C[0] == SAME) {	ans[N-1] = WOLF;		ans[1] = WOLF;
				} else {			ans[N-1] = WOLF;		ans[1] = SHEEP;	}
			} else if(i == 2) {
				ans[0] = WOLF;
				if(C[0] == SAME) {	ans[N-1] = SHEEP;		ans[1] = WOLF;
				} else {			ans[N-1] = SHEEP;		ans[1] = SHEEP;	}
			} else if(i == 3) {
				ans[0] = WOLF;
				if(C[0] == SAME) {	ans[N-1] = WOLF;		ans[1] = SHEEP;
				} else {			ans[N-1] = WOLF;		ans[1] = WOLF;	}
			}
			for (int j = 1; j < N-2; j++) {
				if(C[j] == SAME) {
					if(ans[j] == SHEEP)	ans[j+1] = ans[j-1];
					else				ans[j+1] = (ans[j-1] == SHEEP ? WOLF : SHEEP);
				} else {
					if(ans[j] == SHEEP)	ans[j+1] = (ans[j-1] == SHEEP ? WOLF : SHEEP);
					else				ans[j+1] = ans[j-1];
				}
			}
			f = false;
			if(C[N-2] == SAME) {
				if(ans[N-2] == SHEEP && ans[N-3] == ans[N-1])		f = true;
				else if(ans[N-2] == WOLF && ans[N-3] != ans[N-1])	f = true;
			} else {
				if(ans[N-2] == SHEEP && ans[N-3] != ans[N-1])		f = true;
				else if(ans[N-2] == WOLF && ans[N-3] == ans[N-1])	f = true;
			}
			if(f) {
				f = false;
				if(C[N-1] == SAME) {
					if(ans[N-1] == SHEEP && ans[N-2] == ans[0])		f = true;
					else if(ans[N-1] == WOLF && ans[N-2] != ans[0])	f = true;
				} else {
					if(ans[N-1] == SHEEP && ans[N-2] != ans[0])		f = true;
					else if(ans[N-1] == WOLF && ans[N-2] == ans[0])	f = true;
				}
				if(f) {
					for (int j = 0; j < N; j++) {
						out.print(ans[j]);
					}
					out.println("");
					return;
				}
			}
 		}
		out.println(-1);
	}

	// ------------------------------------------
	// ライブラリ
	// ------------------------------------------
	// Print
	private PrintWriter out = new PrintWriter(System.out);

	// Scanner
	private FastScanner scan = new FastScanner();

	int ni() {
		return scan.nextInt();
	}

	int[] ni(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = ni();
		}
		return a;
	}

	int[][] ni(int y, int x) {
		int[][] a = new int[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ni();
			}
		}
		return a;
	}

	long nl() {
		return scan.nextLong();
	}

	long[] nl(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++) {
			a[i] = nl();
		}
		return a;
	}

	long[][] nl(int y, int x) {
		long[][] a = new long[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = nl();
			}
		}
		return a;
	}

	String ns() {
		return scan.next();
	}

	String[] ns(int n) {
		String[] a = new String[n];
		for (int i = 0; i < n; i++) {
			a[i] = ns();
		}
		return a;
	}

	String[][] ns(int y, int x) {
		String[][] a = new String[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ns();
			}
		}
		return a;
	}
}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
			throw new NumberFormatException();
		return (int) nl;
	}

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


Measured memory_bytes: 23404