AT_abc469_c.Cantrip

You are given a string $S$ of length $N$ consisting of o and x.
$N$ bags are arranged in a row, and each bag contains one sweet.
On the $i$-th bag, "hit" is written if the $i$-th character of $S$ is o, and "miss" is written if it is x.
For each $k=1,2,\dots,N$, solve the following problem.

Takahashi receives the first $k$ bags from the front of the row, eats the sweets inside them, and keeps the bags.
Then, he repeats the following action as many times as possible.

• He discards one bag marked "hit" that he is holding, receives the bag at the front of the row, eats the sweet inside it, and keeps that bag. This action can only be performed when there is still a bag remaining in the row and he is holding a bag marked "hit".

Find the number of sweets he can eat.
Note that when he receives a bag, that bag is removed from the row.

给你一个长度为 $N$ 的字符串 $S$，它仅由字符 o 和 x 组成。
有 $N$ 个袋子排成一排，每个袋子里装有一颗糖果。
第 $i$ 个袋子上写着“hit”，当且仅当 $S$ 的第 $i$ 个字符为 o；写着“miss”，当且仅当该字符为 x。
对每个 $k=1,2,\dots,N$，求解以下问题：

高桥从队列前端依次接收前 $k$ 个袋子，吃掉其中的糖果，并保留这些袋子。
然后，他尽可能多地重复执行以下操作：

• 丢弃一个他手中标记为“hit”的袋子，再从队列前端接收一个袋子，吃掉其中的糖果，并保留该袋子。该操作仅在队列中仍有剩余袋子、且他手中持有至少一个标记为“hit”的袋子时才可执行。

求他总共能吃到多少颗糖果。
注意：当他接收一个袋子时，该袋子即从队列中移除。

The input is given from Standard Input in the following format:

$N$
$S$

输入从标准输入中按以下格式给出：

$N$
$S$

Output a total of $N$ lines.
The $l$-th line should contain the answer for $k=l$.

共输出 $N$ 行。
第 $l$ 行应包含 $k=l$ 时的答案。

Sample 1 Explanation:
For $k=1$, the bag he receives is marked "hit". He discards it, and the bag he then receives is marked "miss", so he cannot perform any further actions.

Constraints

• $1 \leq N \leq 8 \times 10^5$
• $N$ is an integer.
• $S$ is a string of length $N$ consisting of o and x.

样例 1 解释：
当 $k=1$ 时，他收到的袋子标记为 “hit”。他将其丢弃，随后收到的袋子标记为 “miss”，因此他无法再执行任何操作。

约束条件

• $1 \leq N \leq 8 \times 10^5$
• $N$ 是一个整数。
• $S$ 是一个长度为 $N$ 的字符串，仅由字符 o 和 x 组成。