#include <bits/stdc++.h>
//#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int LL;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define endl "\n"
#define SORT(v) sort(v.begin(),v.end())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
//template<class T>void max(T a,T b){if(a<b)return b;else return a;}
//template<class T>void min(T a,T b){if(a>b)return b;else return a;}
//template<class T>bool Max(T&a, T b){if(a < b){a = b;return 1;}return 0;}
//template<class T>bool Min(T&a, T b){if(a > b){a = b;return 1;}return 0;}

//////////////////////////

bool anspro(){
    ll n;cin>>n;
    string s;cin>>s;
    rep(i,0,n-3){
        ll co=0,cn=0,cx=0;
        rep(j,i,i+2){
            if(s[j]=='o')co++;
            else if(s[j]=='-')cn++;
            else cx++;
        }
        if(co==3)return true;
        if(co==2&&cn==1)return true;
    }
    rep(i,0,n-4){
        ll co=0,cn=0,cx=0;
        rep(j,i,i+3){
            if(s[j]=='o')co++;
            else if(s[j]=='-')cn++;
            else cx++;
        }
        if(s[i+1]=='o'){
            if(cx==0)return true;
        }
        if(s[i+2]=='o'){
            if(cx==0)return true;
        }
    }
    rep(i,0,n-5){
        ll co=0,cn=0,cx=0;
        rep(j,i,i+4){
            if(s[j]=='o')co++;
            else if(s[j]=='-')cn++;
            else cx++;
        }
        if(s[i]=='o'&&s[i+4]=='o'){
            if(cx==0)return true;
        }
    }
    rep(i,0,n-1){
        if(s[i]!='o')continue;
        ll pi=i;
        ll pj=-1;
        while(i+1<=n-1){
            i++;
            if(s[i]=='x')break;
            if(s[i]=='o'){
                pj=i;break;
            }
        }
        if(pj==-1)continue;
        if((pj-pi)%2==0)return true;
    }
    return false;
}
int main(){fastio
    ll qu;cin>>qu;
    while(qu--){
        if(anspro())cout<<"O"<<endl;
        else cout<<"X"<<endl;
    }
    
    
    return 0;
}