#include #define rep(i, n) for (ll i = 0; i < (n); ++i) #define rep1(i, n) for (ll i = 1; i <= (n); ++i) #define rrep(i, n) for (ll i = (n - 1); i >= 0; --i) #define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c))) #define ALL(obj) (obj).begin(), (obj).end() #define pb push_back #define to_s to_string #define len(v) (ll)v.size() #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define print(x) cout << (x) << '\n' #define debug(x) cout << #x << ": " << (x) << '\n' using namespace std; using ll = long long; typedef pair P; typedef vector vec; typedef vector> vec2; typedef vector>> vec3; ll MOD = 1e9 + 7; ll devc(ll x, ll y) { return 1 + (x - 1) / y; } templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b> T; rep(_, T){ ll N; cin >> N; string S; cin >> S; bool flag = true; rep(i, N - 2){ if(S[i] == 'o' and S[i + 1] == 'o' and S[i + 2] == 'o') flag = false; if(S[i] == '-' and S[i + 1] == 'o' and S[i + 2] == '-') flag = false; if(S[i] == 'o' and S[i + 1] == '-' and S[i + 2] == 'o') flag = false; if(S[i] == 'o' and S[i + 1] == 'o' and S[i + 2] != 'x') flag = false; if(S[i] != 'x' and S[i + 1] == 'o' and S[i + 2] == 'o') flag = false; } bool m = false; ll ct = 0; rep(i, N){ if(S[i] == 'o') m = true; if(m){ if(S[i] == '-') ++ct; if(S[i] == 'x'){ ct = 0; m = false; } if(S[i] == 'o'){ if(ct > 0 and ct % 2 == 1) flag = false; ct = 0; } } } if(flag) print("X"); else print("O"); } return 0; }