#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
vector<string> th={
  "ooo","oo-","o-o","-oo"
};
vector<string> fh={
  "--o-","-o--"
};
int main(){
  ll t;cin >> t;
  while(t--){
    ll n;cin >> n;string s;cin >> s;
    bool ok=false;
    rep(i,n-2){
      for(auto p:th){
        if(s.substr(i,3)==p)ok=true;
      }
    }
    rep(i,n-3){
      for(auto p:fh){
        if(s.substr(i,4)==p)ok=true;
      }
    }
    ll left=0;bool valid=false;
    rep(i,n){
      if(s[i]=='o'){
        if(valid&&((i-left)%2==0))ok=true;
        valid=true;left=i;
      }
      if(s[i]=='x')valid=false;
    }

    cout << (ok? "O":"X") <<endl;
  }
}