#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    int T;
    cin >> T;
    while(T--) {
        int N;
        cin >> N;
        string S;
        cin >> S;
        int cnt = S[0] == 'o' ? 0 : -INF;
        bool f = 0;
        rep(i, N - 2) {
            string ss = S.substr(i, 3);
            if(ss == "ooo" || ss == "oo-" || ss == "o-o" || ss == "-oo")
                f = 1;
        }
        rep(i, N - 3) {
            string ss = S.substr(i, 4);
            if(ss == "-o--" || ss == "--o-") {
                f = 1;
            }
        }
        FOR(i, 1, N) {
            if(S[i] == '-' && (S[i - 1] == '-' || S[i - 1] == 'o')) {
                cnt++;
            } else if(S[i] == 'o') {
                if(cnt > 0 && cnt % 2 == 1)
                    f = 1;
                cnt = 0;
            } else if(S[i] == 'x')
                cnt == -INF;
        }
        cout << "XO"[f] << endl;
    }
}