#552. 循环子串

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
void solve() {
	int n;
	cin >> n;
	string s;
	cin >> s;
	string t= s;
	reverse(all(t));
	for (int i = 0; i < n; i ++) {
		string te = "";
		for (int j = n - i; j < n; j ++)
			te+= s[j];
		for (int j = 0; j < n - i; j ++)
			te+= s[j];
		if (t == te) {
			puts("YES");
			return;
		}
	}
	puts("NO");
	
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    cin >> t;
    while (t --) solve();
    return 0;
}

先考虑子问题，对于其中一个真子串，翻转后，如果能找到一个k，使得右移k位，还是这个子串，那么我们继续扩大范围，也就是说对于整个串翻转后，我们如果能找到一个k使得移动后的串和翻转后的串相同，那么输出YES，否则输出NO

要重视子问题的研究