Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Arranging The Sheep

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are playing the game "Arranging The Sheep". The goal of this game is to make the sheep line up. The level in the game is described by a string of length $$$n$$$, consisting of the characters '.' (empty space) and '*' (sheep). In one move, you can move any sheep one square to the left or one square to the right, if the corresponding square exists and is empty. The game ends as soon as the sheep are lined up, that is, there should be no empty cells between any sheep.

For example, if $$$n=6$$$ and the level is described by the string "**.*..", then the following game scenario is possible:

- the sheep at the $$$4$$$ position moves to the right, the state of the level: "**..*.";
- the sheep at the $$$2$$$ position moves to the right, the state of the level: "*.*.*.";
- the sheep at the $$$1$$$ position moves to the right, the state of the level: ".**.*.";
- the sheep at the $$$3$$$ position moves to the right, the state of the level: ".*.**.";
- the sheep at the $$$2$$$ position moves to the right, the state of the level: "..***.";
- the sheep are lined up and the game ends.

For a given level, determine the minimum number of moves you need to make to complete the level.

Input

The first line contains one integer $$$t$$$ ($$$1 \le t \le 10^4$$$). Then $$$t$$$ test cases follow.

The first line of each test case contains one integer $$$n$$$ ($$$1 \le n \le 10^6$$$).

The second line of each test case contains a string of length $$$n$$$, consisting of the characters '.' (empty space) and '*' (sheep) — the description of the level.

It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$10^6$$$.

Output

For each test case output the minimum number of moves you need to make to complete the level.

Example

Input

5 6 **.*.. 5 ***** 3 .*. 3 ... 10 *.*...*.**

Output

1 0 0 0 9

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/12/2021 13:58:48 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|