AT_abc469_c [ABC469C] 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.

The input is given from Standard Input in the following format: > $ N $ $ S $

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

### Sample Explanation 1 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`.