#include <algorithm>
#include <bitset>
#include <boost/dynamic_bitset.hpp>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeindex>
#include <typeinfo>
#include <vector>

using namespace std;

#define DEBUG(x) cout << #x << ": " << x << endl
#define INFILE() freopen("input.txt", "r", stdin)

using ll = long long;
using ull = unsigned long long;
using i_i = pair<int, int>;
using ll_i = pair<ll, int>;
using i_ll = pair<int, ll>;
using d_i = pair<double, int>;
using ll_ll = pair<ll, ll>;
using d_d = pair<double, double>;

constexpr ll LL_MOD = 1000000009;
constexpr int I_MOD = 1000000007;
constexpr double EPS = numeric_limits<double>::epsilon();
constexpr double PI = 3.14159265358979323846264338327950288;

template <class T> void scan(vector<T> &v);
void scan(vector<string> &v, bool isWord = true);
boost::dynamic_bitset<> scan(char trueValue = 'o');

int main(int argc, char *argv[]) {
  // INFILE();
  int n;
  cin >> n;
  auto ans = scan();

  vector<bitset<100000>> v(4);
  v[1][1] = true;
  v[2][0] = true;
  v[3][0] = true;
  v[3][1] = true;

  for (int i = 2; i < n; i++) {
    for (auto &b : v) {
      if (ans[i - 1]) {
        b[i] = (b[i - 1]) ? b[i - 2] : !b[i - 2];
      } else {
        b[i] = (b[i - 1]) ? !b[i - 2] : b[i - 2];
      }
    }
  }

  bool isAns = false;
  bitset<100000> ret;
  for (const auto &b : v) {
    bool last = false, first = false;

    if (ans[n - 1]) {
      last = b[n - 1] == (b[0] == b[n - 2]);
    } else {
      last = b[n - 1] == (b[0] != b[n - 2]);
    }

    if (ans[0]) {
      first = b[0] == (b[n - 1] == b[1]);
    } else {
      first = b[0] == (b[n - 1] != b[1]);
    }

    if (last && first) {
      isAns = true;
      ret = b;
      break;
    }
  }

  if (!isAns) {
    cout << "-1\n";
    return 0;
  }

  string str = ret.to_string();
  reverse(begin(str), end(str));
  replace(begin(str), end(str), '1', 'S');
  replace(begin(str), end(str), '0', 'W');
  cout << str.substr(0, n) << "\n";
  return 0;
}

template <class T> void scan(vector<T> &v) {
  map<type_index, const char *const> m = {{typeid(int), "%d"},
                                          {typeid(ll), "%lld"},
                                          {typeid(double), "%lf"},
                                          {typeid(char), "%c"}};

  auto tFormat = m[typeid(T)];

  for (T &n : v) {
    scanf(tFormat, &n);
  }
}

void scan(vector<string> &v, bool isWord) {
  if (isWord) {
    for (auto &n : v) {
      cin >> n;
    }
    return;
  }

  int i = 0, size = v.size();
  string s;
  getline(cin, s);

  if (s.size() != 0) {
    i++;
    v[0] = s;
  }

  for (; i < size; ++i) {
    getline(cin, v[i]);
  }
}

boost::dynamic_bitset<> scan(char trueValue) {
  string s;
  getline(cin, s);

  if (s.size() == 0) {
    getline(cin, s);
  }

  for_each(begin(s), end(s),
           [trueValue](char &c) { c = (c == trueValue) ? '1' : '0'; });
  return boost::dynamic_bitset<>(string(rbegin(s), rend(s)));
}


Measured memory_bytes: 732