Ma5termind is very fond of ice-creams. He bought himself N ice-creams of two types which are represented in the form of string of 0's and 1's such that 0 represents ice-cream of type 1 and 1 represents ice-cream of other type. Now he is in dilemma to eat which ice-cream first.
So to make things simple he decided to eat all ice-cream of one type first and then the other type ice-cream. But ice-cream of both types are arranged in random order. He can perform a swap operation in which he can swap ice-cream from any position i and j.
Now ma5termind wants to seggregate ice-cream of two types in minimum possible number of swaps otherwise ice cream will melt and he will become sad.
Help him figure out the minimum number of swaps needed.

Input:

Each input file will contain a T test case. First line will contain N the number of ice-creams and the next line will contain a string of 0's and 1's denoting the types of ice-creams.

Ouput:

For each testcase print a single integer denoting the minimum swaps.

Constraints:

• 1 ≤ T ≤ 5
• 1 ≤ N ≤ 10⁵

See sample I/O for more clarification.

Scoring:

• subtask 1: 1 ≤ N ≤ 1000 ( 20 pts )
• subtask 2: 1 ≤ N ≤ 10⁵ ( 80 pts )