using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Text;

class Myon
{
    public Myon() { }
    public static int Main()
    {
        cin = new Scanner();
        new Myon().calc();
        return 0;
    }


    static Scanner cin;
    int N;
    string S;
    bool[] isWolf;

    void calc()
    {
        N = cin.nextInt();
        S = cin.next();
        // 4パターン試して矛盾がないことを見る
        if (loop())
        {
            isWolf.ToList().ForEach(i => Console.Write(i ? "W" : "S"));
            Console.Write("\n");
        }
        else
        {
            Console.WriteLine(-1);
        }
        Console.ReadLine();
    }

    bool loop()
    {
        bool[] loop = new bool[] { false, true };
        bool result = false;
        foreach (var i in loop)
        {
            foreach (var j in loop)
            {
                result = check(i, j);
                if (result) return true;
            }
        }
        return false;
    }

    bool check(bool j1, bool j2)
    {
        List<bool> isWolfList = new bool[S.Length + 2].ToList();
        isWolfList[0] = j1;
        isWolfList[1] = j2;
        for (int i = 0; i < S.Length; i++)
        {
            if (i == 0)
            {
                if ((isWolfList[i] && S[i] == 'o') || (!isWolfList[i] && S[i] == 'x'))
                {
                    // 両隣が異なる場合
                    isWolfList[S.Length - 1] = !isWolfList[i + 1];
                }
                else
                {
                    // 両隣が一致する場合
                    isWolfList[S.Length - 1] = isWolfList[i + 1];
                }
            }
            else
            {
                if ((isWolfList[i] && S[i] == 'o') || (!isWolfList[i] && S[i] == 'x'))
                {
                    // 両隣が異なる場合
                    isWolfList[i + 1] = !isWolfList[i - 1];
                }
                else
                {
                    // 両隣が一致する場合
                    isWolfList[i + 1] = isWolfList[i - 1];
                }
            }
        }
        int j = S.Length;
        if ((isWolfList[j] && S[0] == 'o') || (!isWolfList[j] && S[0] == 'x'))
        {
            // 両隣が異なる場合
            isWolfList[j + 1] = !isWolfList[j - 1];
        }
        else
        {
            // 両隣が一致する場合
            isWolfList[j + 1] = isWolfList[j - 1];
        }
        isWolf = new bool[S.Length];
        for(int i = 0; i < S.Length; i++)
        {
            isWolf[i] = isWolfList[i];
        }

        return isWolfList.Last() == isWolfList[1] && isWolfList[S.Length] == isWolfList[0];
    }


    class Scanner
    {
        string[] s;
        int i;

        char[] cs = new char[] { ' ' };

        public Scanner()
        {
            s = new string[0];
            i = 0;
        }

        public string next()
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int nextInt()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt() + add;
            }
            return Array;
        }

        public long nextLong()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong() + add;
            }
            return Array;
        }

        public double nextDouble()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextDouble() + add;
            }
            return Array;
        }
    }
}


Measured memory_bytes: 15456