#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
//o-set
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//debugging tool
template<typename T>
void debug(string name, T value) {
cerr << name << " = " << value << endl;
}
template<typename T, typename U>
void debug(string name, pair<T, U> value) {
cerr << name << " = {" << value.first << ", " << value.second << "}" << endl;
}
template<typename T>
void debug(string name, vector<T> v) {
cerr << name << " =[ ";
for (size_t i = 0; i < v.size(); i++) {
if (i) {
cerr << ", ";
}
cerr << v[i];
}
cerr << "]" << endl;
}
template<typename T>
void debug(string name, set<T> v) {
cerr << name << " =[ ";
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
cerr << ", ";
}
cerr << *it;
}
cerr << "]" << endl;
}
template<typename T, typename U>
void debug(string name, map<T, U> v) {
cerr << name << " =[ ";
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
cerr << ", ";
}
cerr << it->first << ": " << it->second;
}
cerr << "]" << endl;
}
#define DEBUG(x) debug(#x, x);
#define int long long
#define endl "\n"
#define rep(i, a, b) for (int i = a; i < b; i++)
#define fr(i, a, b) for (int i = a; i <= b; i++)
typedef vector<int> vi;
void solve() {
int n; cin >> n;
string s; cin >> s;
string ok = "SeriousOJ";
int curid = 0;
rep (i, 0, ok.size()) {
char paitehbe = ok[i];
bool paisi = 0;
rep (j, curid , n) {
if (s[j] == paitehbe) {
paisi = 1;
curid = j;
break;
}
}
if (!paisi) {
cout << "NO\n";
return;
}
}
cout << "YES\n";
}
signed main() {
ios_base::sync_with_stdio(false);cin.tie(0);
int tt; cin >> tt;
while (tt--)
solve();
}