#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvv vector<vvl>
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvvl(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define rep(c, a, b) for(ll c=a;c<b;c++)
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
//typedef __int128_t lll;
using namespace std;

int main(int argc, char const *argv[]) {
  ll T;std::cin >> T;

  re(t, T){
    ll n;std::cin >> n;
    string s;std::cin >> s;

    bool f = false;
    re(i, s.size()-2){
      if(s[i]=='o'&&s[i+1]=='o'&&s[i+2]=='-') f = true;
      if(s[i]=='-'&&s[i+1]=='o'&&s[i+2]=='o') f = true;
      if(s[i]=='o'&&s[i+1]=='o'&&s[i+2]=='o') f = true;
    }

    for(int i=0;i<s.size();i++){
      bool flag = true;
      if(s[i]!='o') continue;
      for(int j=i;j<s.size();j++){
        if(s[j]=='x') {
          flag = false;
          break;
        }
        if(i!=j&&(j-i)%2==0&&s[j]=='o') break;

        if(j==s.size()-1){
          flag = false;
          break;
        }
      }
      f |= flag;
    }
    std::cout << (f?"O":"X") << '\n';
  }
  return 0;
}