Chef had an interesting dream last night. He dreamed of a new revolutionary chicken recipe. When he woke up today he tried very hard to reconstruct the ingredient list. But, he could only remember certain ingredients. To simplify the problem, the ingredient list can be represented by a string of lowercase characters 'a' - 'z'.
Chef can recall some characters of the ingredient list, all the others, he has forgotten. However, he is quite sure that the ingredient list was a palindrome.
You are given the ingredient list Chef dreamed last night. The forgotten characters are represented by a question mark ('?'). Count the number of ways Chef can replace the forgotten characters with characters 'a' - 'z' in such a way that resulting ingredient list is a palindrome.
-----Input-----
The first line of input contains a single integer T, the number of test cases. T lines follow, each containing a single non-empty string - the ingredient list as recalled by Chef. Whatever letters he couldn't recall are represented by a '?'.
-----Output-----
For each test case, output a single line containing the number of valid ways the ingredient list could be completed. Since the answers can be very large, output each answer modulo 10,000,009.
-----Example-----
Input:
5
?
??
ab?
a?c
aba
Output:
26
26
1
0
1
-----Constraints-----
1 ≤ T ≤ 20
1 ≤ sum of length of all input strings ≤ 1,000,000
Each input string contains only lowercase roman letters ('a' - 'z') or question marks.
for _ in range(int(input())):
 s=list(input())
 n=len(s)
 an=1
 mod=10000009
 for i in range(n):
  if s[i]=="?" and s[n-i-1]=="?":
   an=(an*26)%mod
   s[i]="."
   s[n-i-1]="."
  elif s[i]!="?" and s[n-i-1]!="?":
   if s[i]!=s[n-i-1]:
    an=0
    break
 print(an%mod)
   
   

for _ in range(int(input())):
 s=list(input())
 n=len(s)
 an=1
 mod=10000009
 for i in range(n):
  if s[i]=="?" and s[n-i-1]=="?":
   an=(an*26)%mod
   s[i]="."
   s[n-i-1]="."
  elif s[i]!="?" and s[n-i-1]!="?":
   if s[i]!=s[n-i-1]:
    an=0
    break
 print(an%mod)
   
   
