It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example: 

s: "abab" 

The prefixes are: "a", "ab", "aba", "abab" 

For each prefix, we can count the times it matches in s. So we can see that prefix "a" matches twice, "ab" matches twice too, "aba" matches once, and "abab" matches once. Now you are asked to calculate the sum of the match times for all the prefixes. For "abab", it is 2 + 2 + 1 + 1 = 6. 

The answer may be very large, so output the answer mod 10007. 

InputThe first line is a single integer T, indicating the number of test cases. 

For each case, the first line is an integer n (1 <= n <= 200000), which is the length of string s. A line follows giving the string s. The characters in the strings are all lower-case letters. 

OutputFor each case, output only one number: the sum of the match times for all the prefixes of s mod 10007.Sample Input

14abab

Sample Output

6 题意： 问所有前缀出现的次数． 思路： 求出扩展kmp的Next数组，然后把Next的值全部加起来就是答案． 扩展kmp的Next[i]表示的是，以i为开头的后缀，与整个字符串的lcp的长度，那么显而易见，整个字符串长度为1,2,...,Next[i]的前缀在这里都出现了一次，所以此时答案加上Next[i];

#include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include