- Time limit: 1.00 s
- Memory limit: 512 MB
Given a string, your task is to calculate the number of different strings that can be created using its characters.
The only input line has a string of length n. Each character is between a–z.
Print the number of different strings modulo 10^9+7.
- 1 \le n \le 10^6