Texts:
Ankur has a word W of N characters consisting only of lowercase English letters (a through z). Since he is lazy, he occasionally commits mistakes while reading the word. When Ankur is at the ith letter of the word, he sometimes reads the i-th, (i-1)th, or (i+1)th letter of W, for all i in the range of the length of W. (For the first character, Ankur can read the first or second character. Similarly, for the last character, he can read the last or next-to-last character.) Your task is to determine, for a given word W, how many maximum distinct words Ankur can read. Since this number may be very large, please output it modulo 1000000007 (10^9 + 7).
Input: A string consisting only of lowercase English letters (a through z)
Output: For each test case, print the number of distinct words Ankur can read modulo 10^9 + 7.
Constraints:
1 <= T <= 100
1 <= length of W <= 1000