Energy Tycoon

Vasya is playing a turn-based strategy game called Energy Tycoon.

The rules are simple.

• The board has $n$ slots in a row.
• A power plant occupies one or two consecutive slots and produces one unit of energy.
• Every turn the game offers one new power plant, and you can place it on the board if you want to. If there is no room for it, you can remove any of the plants you built earlier.
• At the end of every turn, the game adds the energy produced by the plants standing on the board to the total score.

Vasya already knows which power plant he can build on each turn. What is the largest total score he can reach?

The first line contains the number of slots $n$ ($1 \le n \le 100000$).

The second line contains a string $s$. If the $i$-th character of $s$ is 1, you can build a one-slot power plant on turn $i$, and if it is 2, you can build a two-slot power plant on turn $i$. The number of turns does not exceed 100000.

Print the largest total score that can be achieved.