B. String Modification

B. String Modification

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has a string ss of length nn. He decides to make the following modification to the string:

1. Pick an integer kk, (1≤k≤n1≤k≤n).
2. For ii from 11 to n−k+1n−k+1, reverse the substring s[i:i+k−1]s[i:i+k−1] of ss. For example, if string ss is qwer and k=2k=2, below is the series of transformations the string goes through:
   • qwer (original string)
   • wqer (after reversing the first substring of length 22)
   • weqr (after reversing the second substring of length 22)
   • werq (after reversing the last substring of length 22)
   Hence, the resulting string after modifying ss with k=2k=2 is werq.

Vasya wants to choose a kk such that the string obtained after the above-mentioned modification is lexicographically smallest possible among all choices of kk. Among all such kk, he wants to choose the smallest one. Since he is busy attending Felicity 2020, he asks for your help.

A string aa is lexicographically smaller than a string bb if and only if one of the following holds:

• aa is a prefix of bb, but a≠ba≠b;
• in the first position where aa and bb differ, the string aa has a letter that appears earlier in the alphabet than the corresponding letter in bb.

Input

Each test contains multiple test cases.

The first line contains the number of test cases tt (1≤t≤50001≤t≤5000). The description of the test cases follows.

The first line of each test case contains a single integer nn (1≤n≤50001≤n≤5000) — the length of the string ss.

The second line of each test case contains the string ss of nn lowercase latin letters.

It is guaranteed that the sum of nn over all test cases does not exceed 50005000.

Output

For each testcase output two lines:

In the first line output the lexicographically smallest string s′s′ achievable after the above-mentioned modification.

In the second line output the appropriate value of kk (1≤k≤n1≤k≤n) that you chose for performing the modification. If there are multiple values of kk that give the lexicographically smallest string, output the smallest value of kk among them.

Example

input

Copy

6
4
abab
6
qwerty
5
aaaaa
6
alaska
9
lfpbavjsm
1
p

output

Copy

abab
1
ertyqw
3
aaaaa
1
aksala
6
avjsmbpfl
5
p
1

Note

In the first testcase of the first sample, the string modification results for the sample abab are as follows :

• for k=1k=1 : abab
• for k=2k=2 : baba
• for k=3k=3 : abab
• for k=4k=4 : baba

  The lexicographically smallest string achievable through modification is abab for k=1k=1 and 33. Smallest value of kk needed to achieve is hence 11

手写一下样例不难发现，交换k次就是把原字符串的前缀后缀重新拼接，注意交换次数为奇数的时候还需要翻转前缀

# include
# include
# include
 
using namespace std;
 
 
int main ()
{
 
    int t;
 
    cin>>t;
 
    while(t--)
    {
        int n;
 
        cin>>n;
 
        string s;
        cin>>s;
 
        string minn=s;
        int ans=1;
 
        string pree="";
        pree+=s[0];
        int pos=1;
 
        for(int i=1; i
        {
            string now;
 
 
            int cnt=n-i;
            if((cnt)%2)
            {
                string bac=s.substr(i);
 
                now=bac+pree;
 
 
            }
            else
            {
 
                string pre=s.substr(0,i);
 
                string bac=s.substr(i);
 
 
 
                now=bac+pre;
 
 
 
            }
 
            pree=s[pos]+pree;
            pos++;
 
 
            if(now
            {
                ans=i+1;
                minn=now;
            }
        }
 
 
        cout<
 
    }
 
    return 0;
}