#include using namespace std; #include using namespace atcoder; using ll = long long; using vll = vector; using vvll = vector; using vvvll = vector; #define all(A) A.begin(),A.end() #define rep(i, n) for (ll i = 0; i < (ll) (n); i++) template bool chmax(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p < q) { p = q; return 1; } else { return 0; } } template bool chmin(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p > q) { p = q; return 1; } else { return 0; } } ll modPow(long long a, long long n, long long p) { if (n == 0) return 1; // 0乗にも対応する場合 if (n == 1) return a % p; if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p; long long t = modPow(a, n / 2, p); return (t * t) % p; } ll gcd(ll(a), ll(b)) { if (a == 0)return b; if (b == 0)return a; ll c = a; while (a % b != 0) { c = a % b; a = b; b = c; } return b; } ll sqrtz(ll N) { ll L = 0; ll R = sqrt(N) + 10000; while (abs(R - L) > 1) { ll mid = (R + L) / 2; if (mid * mid <= N)L = mid; else R = mid; } return L; } using mint =ll; using vm = vector; using vvm = vector; using vvvm = vector; /* vector fact, factinv, inv; const ll mod = 1e9 + 7; void prenCkModp(ll n) { fact.resize(n + 5); factinv.resize(n + 5); inv.resize(n + 5); fact[0] = fact[1] = 1; factinv[0] = factinv[1] = 1; inv[1] = 1; for (ll i = 2; i < n + 5; i++) { fact[i] = (fact[i - 1] * i) % mod; inv[i] = ((mod - ((inv[mod % i] * (mod / i))) % mod) + mod) % mod; factinv[i] = (factinv[i - 1] * inv[i]) % mod; } } ll nCk(ll n, ll k) { if (n < k || k < 0) return 0; return (fact[n] * ((factinv[k] * factinv[n - k]) % mod)) % mod; } */ bool solve(){ string S,T; cin>>T>>S; ll x=0; for(auto s:S){ if(x==T.size())return false; while(T[x]!=s){ x++; if(x==T.size())return false; } x++; } return true; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll T; cin>>T; rep(t,T){ ll N; string S; cin>>N>>S; ll k=-1e18; bool W=0; rep(i,N){ if(i0)W=1; k=0; } else if(S[i]=='x'){ k=-1e18; } else k++; } cout<<(W?"O":"X")<