Problem F
Giganotosaurus Game

Suffering from a poor internet connection, you are playing a casual game in your web browser to pass the time. You, the player, control a Giganotosaurus that is running through a linear world with obstacles (cactuses). You win the game if you reach the end of the world without hitting any cactuses.

The world consists of $n$ cells, which can either be empty or contain a cactus. You start at the leftmost cell (which is always empty) and the goal is to get past the rightmost cell. At each cell, the Giganotosaurus can either move one position to the right, or jump over some fixed number of cells. For the first jump, you skip one cell, but with each subsequent jump, you skip one additional cell compared to the previous jump. That is, the $k$th jump skips exactly $k$ cells.

You quickly master this simple game, so you pose a more interesting challenge: count how many ways there are to win the game. As an example, consider the second sample case, visualized in Figure 1.

Figure 1: Visualization of the second sample input, for which there are three ways to win the game.

Input

The input consists of:

• One line with an integer $n$ ($1 \le n \le 10^5$), the length of the world.

• One line with $n$ characters, each character being either ‘#’ or ‘.’, indicating a cactus or an empty cell, respectively.

Output

Output the number of ways to win the game, modulo $10^9 + 7$.

4
....

8

4
.#..

3

7
.#...##

1

7
..#.#.#

0