#include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
#define invrep(i,n) for(int64_t i=n-1;i >= 0;i--)
using namespace std;

//////全探索したいときに開けよ////////
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;

void setfspattern_core(int floor,int number,int degree){
  if(floor==degree){
    fspattern.at(fspcnt) = fspattern_draft;
    fspcnt++;
  }else{
    rep(i,number){
      fspattern_draft.at(floor) = i;
      setfspattern_core(floor+1,number,degree);
    }
  }
}

void setfspattern(int number,int degree){
  fspcnt = 0;
  int64_t array_num = 1;
  rep(i,degree){
    array_num *= number;
  }
  fspattern = vector<vector<int>>(array_num,vector<int>(degree));
  fspattern_draft = vector<int>(degree);
  setfspattern_core(0,number,degree);
}

//////nCrのmodを求めたいときに開けよ/////////
//int64_t univMod = 1000000007;
//int64_t factnum = 100000
//vector<int64_t> modfact(factnum);
//vector<int64_t> modinvfact(factnum);

/*void setmodfact(){
  for(int i=0;i<factnum;i++){
    if(i == 0){
      modfact.at(i) = 1;
    }else{
      modfact.at(i) = (modfact.at(i-1)*i)%univMod;
    }
  }
}

int64_t calcmodpower(int64_t a,int64_t n){
  int64_t res = 1;
  while(n != 0){
    if(n & 1){
      res = (res * a) % univMod;
    }
    a = (a*a) % univMod;
    n = n >> 1;
  }
  return res;
}

int64_t calcinverse(int64_t n){
	return calcmodpower(n,univMod-2);
}

void setmodinvfact(){
  for(int i=0;i<factnum;i++){
    if(i==0){
      modinvfact.at(i) = 1;
    }else{
      modinvfact.at(i) = calcmodpower(modfact.at(i),univMod-2);
    }
  }
}*/


/*
int64_t calcGCD(int64_t a,int64_t b){
	int64_t p = a;
	int64_t q = b;
	int64_t c = a%b;
	while(c != 0){
		p = q;
		q = c;
		c = p%q;
	}
	return q;
}
*/

int main(){
  int n;
  cin >> n;
  string s;
  cin >> s;
  vector<int> issheep(n);
  rep(k,4){
    issheep.at(0) = k % 2;
    issheep.at(1) = k / 2;
    rep(i,n-1){
      if(i == 0){
        //through
      }else{
        if(s.at(i)=='o'){
          issheep.at(i+1) = 1-issheep.at(i-1)^issheep.at(i);
        }else{
          issheep.at(i+1) = issheep.at(i-1)^issheep.at(i);
        }
      }
    }
    bool disfla1 = false;
    bool disfla2 = false;
    bool disfla3 = false;
     if(s.at(n-1) == 'o'){
      if(issheep.at(0) == 1-issheep.at(n-2)^issheep.at(n-1)){
        disfla3 = true;
      }
    }else{
      if(issheep.at(0) == issheep.at(n-2)^issheep.at(n-1)){
        disfla3 = true;
      }
    }
    
    
    if(s.at(0) == 'o'){
      if(issheep.at(1) == 1-issheep.at(n-1)^issheep.at(0)){
        disfla1 = true;
      }
    }else{
      if(issheep.at(1) == issheep.at(n-1)^issheep.at(0)){
        disfla1 = true;
      }
    }
    
    if(s.at(1) == 'o'){
      if(issheep.at(2) == 1-issheep.at(0)^issheep.at(1)){
        disfla2 = true;
      }
    }else{
      if(issheep.at(2) == issheep.at(0)^issheep.at(1)){
        disfla2 = true;
      }
    }
   
    
    if(disfla1 && disfla2 && disfla3){
      rep(i,n){
        if(issheep.at(i)){
          cout << 'S';
        }else{
          cout << 'W';
        }
      }
      cout << endl;
      return 0;
    }      
  }
  cout << -1 << endl;
          
            
            

}

Measured memory_bytes: 1024