Given a string, your task is to calculate the number of different strings that can be created using its characters.

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$

Example

Input:

aabac

Output:

20