Problem Description

Mr X likes to play string games.

Mr X has an operation sequence. This operation sequence can be written as a string. For each operation, the next character of the operation sequence can be inserted before or after the current string. For example, my operation sequence is "aabac", suppose the sequence obtained after the first four operations is "baaa", then after the last operation, the string may become "baaac" or "cbaaa". It can be seen that there is only one operation method for the first operation. For other operations, there are only two methods of operation.

For each operation method, there will be a score. The smaller the lexicographic order of the final string, the higher the final score.

Then, for a given operation sequence, how many operation methods can get the maximum score.

The two operation methods are different. If and only if there is a certain operation (not the first operation), one operation will be inserted before the current string, and the other operation will be inserted after the current string.

Input

Enter a positive integer $T$ ($T \leq 10$) on the first line to represent the number of test cases.

For each test case：

the first line contains a integer $n$ ($1 \leq n \leq 100000$) to represent the length of the string.

the second line contains a string of lowercase letters , which represents the sequence of operations.

Output

For each test case, output a line of a positive integer to represent the number of schemes, and the answer is modulo $1000000007$

1
5
abcde

1