#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const double tiaohe = 0.57721566490153286060651209;
long long oula(long long x) {
  long long res = x;
  for (register int i = 2; i <= x / i; ++i) {
    if (x % i == 0) {
      res = res / i * (i - 1);
      while (x % i == 0) x /= i;
    }
  }
  if (x > 1) res = res / x * (x - 1);
  return res;
}
long long quickmod(long long a, long long n, long long m) {
  long long s = 1;
  while (n) {
    if (n & 1) {
      s = s * a % m;
    }
    a = (a * a) % m;
    n = n / 2;
  }
  return s;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void ex_gcd(long long a, long long b, long long &x, long long &y,
            long long &d) {
  if (!b) {
    d = a, x = 1, y = 0;
  } else {
    ex_gcd(b, a % b, y, x, d);
    y -= x * (a / b);
  }
}
long long inv(long long t, long long p) {
  long long d, x, y;
  ex_gcd(t, p, x, y, d);
  return d == 1 ? (x % p + p) % p : -1;
}
bool isPrime(long long x) {
  if (x <= 1) return false;
  if (x == 2) return true;
  if (x % 2 == 0) return false;
  long long i, m;
  m = sqrt(x);
  for (register int i = 2; i <= m; ++i) {
    if (x % i == 0) return false;
  }
  return true;
}
const int N = 1e5 + 5;
int t;
int main() {
  cin >> t;
  while (t--) {
    int n;
    string a;
    cin >> n >> a;
    int tt = a.size() - 1;
    string mi = a;
    vector<int> v;
    for (register int i = 1; i <= n - 1; ++i) {
      string test = 'x' + a;
      string cp(&test[1], &test[i + 1]);
      if ((i + 1) % 2 == n % 2) reverse(cp.begin(), cp.end());
      test.erase(0, i + 1);
      test = test + cp;
      if (test < mi) {
        v.clear();
        mi = test;
        v.emplace_back(i);
      } else if (test == mi)
        v.emplace_back(i);
    }
    if (mi == a) {
      cout << a << endl;
      puts("1");
      continue;
    }
    sort(v.begin(), v.end());
    cout << mi << endl;
    cout << *v.begin() + 1 << endl;
  }
  return 0;
}
