Code Submission Evaluation System | Login |

**Task** | Statistics

Time limit: | 1.00 s | Memory limit: | 512 MB |

You are given a string that consists of $n$ characters between a–z.

On each turn, you may remove any two adjacent characters that are the same. Your goal is to construct an empty string by removing all the characters.

In how many ways can you do this?

The only input line has a string of length $n$.

Print one integer: the number of ways modulo $10^9+7$.

- $1 \le n \le 500$

Input:

`aabccb`

Output:

`3`