/**
 *      purpose : 
 *      author  : kyomukyomupurin
 *      created : 
**/

// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// math, algorithm
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>
// etc
#include <bitset>
#include <cassert>
#include <cctype>
#include <cstring>
#include <chrono>
#include <ext/random>
#include <ext/rope>
#include <functional>
#include <iomanip>
#include <random>
#include <utility>
// using-directive
using namespace std;
// alias template
using int64 = long long;
using ull = unsigned long long;
using vi = std::vector<int>;
using vl = std::vector<int64>;
using pii = std::pair<int, int>;
using pii = std::pair<int, int>;
using pll = std::pair<int64, int64>;
// text macro replacement
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(_) (_).begin(), (_).end()
#define rall(_) (_).rbegin(), (_).rend()
#define print(_) std::cout << (_) << '\n'
#define debug(_) std::cerr << #_ << ": " << (_) << '\n'
// variadic template
template<typename T> inline void chmin(T &a, T b) {if (a > b) a = b; return;}
template<typename T> inline void chmax(T &a, T b) {if (a < b) a = b; return;}
template<typename T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {
  os << "{";
  for (size_t i = 0; i < vec.size(); ++i) {
    os << vec[i] << ",}"[i == vec.size() - 1];
  }
  return os;
}
template<typename T, typename U> std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
  return os << "{" << p.first << " " << p.second << "}";
}
// constant
const int INF = (1<<30) - 1;  // 1.073741823e9
const int64 INF64 = (1LL<<62) - 1;  // 4.611686018427387903e18
const int MOD = 1000000007;

int n;
string s;

void solve(vector<char>& vec) {
  for (size_t i = 1; i < n - 1; ++i) {
    if (s[i] == 'o' && vec[i] == 'S') {
      vec[i + 1] = vec[i - 1];
    } else if (s[i] == 'o' && vec[i] == 'W') {
      vec[i - 1] == 'S' ? vec[i + 1] = 'W' : vec[i + 1] = 'S';
    } else if (s[i] == 'x' && vec[i] == 'S') {
      vec[i - 1] == 'S' ? vec[i + 1] = 'W' : vec[i + 1] = 'S';
    } else if (s[i] == 'x' && vec[i] == 'W') {
      vec[i + 1] = vec[i - 1];
    }
  }
}

bool check(const vector<char>& vec) {
  for (int i = 0; i < n; ++i) {
    if (i == 0) {
      if (vec[i] == 'S') {
        if (s[i] == 'o' && vec[1] != vec[n - 1] || s[i] == 'x' && vec[1] == vec[n - 1]) {
          return false;
        }
      } else {
        if (s[i] == 'o' && vec[1] == vec[n - 1] || s[i] == 'x' && vec[1] != vec[n - 1]) {
          return false;
        }
      }
    } else if (i == n - 1) {
      if (vec[i] == 'S') {
        if (s[i] == 'o' && vec[0] != vec[n - 2] || s[i] == 'x' && vec[0] == vec[n - 2]) {
          return false;
        }
      } else {
        if (s[i] == 'o' && vec[0] == vec[n - 2] || s[i] == 'x' && vec[0] != vec[n - 2]) {
          return false;
        }
      }
    } else {
      if (vec[i] == 'S') {
        if (s[i] == 'o' && vec[i - 1] != vec[i + 1] || s[i] == 'x' && vec[i - 1] == vec[i + 1]) {
          return false;
        }
      } else {
        if (s[i] == 'o' && vec[i - 1] == vec[i + 1] || s[i] == 'x' && vec[i - 1] != vec[i + 1]) {
          return false;
        }
      }
    }
  }
  return true;
}



int main(){
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  cin >> n;
  cin >> s;

  vector<char> a1(n), a2(n), a3(n), a4(n);

  // 最初の 2 つを決め打ちして最後に最初の辻褄が合うかチェック
  //  SS
  a1[0] = 'S'; a1[1] = 'S';
  solve(a1);
  if (check(a1)) {
    rep(i, n) cout << a1[i];
    cout << '\n';
    return 0;
  }

  //  WW
  a2[0] = 'W'; a2[1] = 'W';
  solve(a2);
  if (check(a2)) {
    rep(i, n) cout << a2[i];
    cout << '\n';
    return 0;
  }
  //  SW
  a3[0] = 'S'; a3[1] = 'W';
  solve(a3);
  if (check(a3)) {
    rep(i, n) cout << a3[i];
    cout << '\n';
    return 0;
  }
  //  WS
  a4[0] = 'W'; a4[1] = 'S';
  solve(a4);
  if (check(a4)) {
    rep(i, n) cout << a4[i];
    cout << '\n';
    return 0;
  }
  cout << -1 << '\n';

  return 0;
}

Measured memory_bytes: 896