1316B.cpp

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

#ifndef ONLINE_JUDGE
#include "debug.h"
#endif

using ll = long long;
using maxheap = priority_queue<ll>; // maxheap
using minheap = priority_queue<ll, vector<ll>, greater<ll>>; // minheap
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sort_and_unique(a) \
    sort(all(a));          \
    (a).resize(unique(all(a)) - (a).begin())
#define minv(a) *min_element(all(a))
#define maxv(a) *max_element(all(a))
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ins insert
#define sz(x) ((int)(x).size())
#define pw(x) (1LL << (x))
#define setbits(x) __builtin_popcountll(x)
const ll Mod = 998244353;
const ll mod = 1e9 + 7;
const ll inf = 1e18;

void solve()
{
    ll n;
    cin>>n;
    string s;
    cin>>s;

    vector<pair<string, ll>> v;
    for(int k=0;k<n;k++) {
        string tt;
        if((k+1+n)%2 == 0) {
            for(int j = k;j<n;j++) {
                tt+=s[j];
            }
            ll z = k;
            z--;
            while(z>=0) {
                tt+=s[z];
                z--;
            }
        }
        else {
            for(int j = k;j<n;j++) {
                tt+=s[j];
            }
            ll z = 0;
            while(z<k) {
                tt+=s[z];
                z++;
            }
        }
        v.pb({tt, k+1});
    }

    sort(all(v));
    cout<<v[0].first<<endl;
    cout<<v[0].second<<endl;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin>>t;
    while(t--)
        solve();

    return 0;
}