give you a string, please output the result of the following function mod 1000000007
n is the length of the string
f() is the function of fibonacci, f(0) = 0, f(1) = 1...
a[i] is the total number of times any prefix appear in the suffix s[i....n-1].
(the prefix means s[0...i] )
multiple test cases.
each test case will give you a string consists of lowercase letters, the length of which is no more than 100000.
ouput a number.
所以答案是f(3) + f(1)