- Time limit: 1.00 s
- Memory limit: 512 MB
Input
The only input line has a string of length $n$. Each character is between a–z.
Output
Print the number of different strings modulo $10^9+7$.
Constraints
- $1 \le n \le 10^6$
Input:
aabac
Output:
20
aabac
20