Case of the Zeros and Ones

Description

Andrewid the Android is a galaxy-famous detective. In his free time he likes to think about strings containing zeros and ones.

Once he thought about a string of length n consisting of zeroes and ones. Consider the following operation: we choose any two adjacent positions in the string, and if one them contains 0, and the other contains 1, then we are allowed to remove these two digits from the string, obtaining a string of length n - 2 as a result.

Now Andreid thinks about what is the minimum length of the string that can remain after applying the described operation several times (possibly, zero)? Help him to calculate this number.

Input

First line of the input contains a single integer n (1 ≤ n ≤ 2·10⁵), the length of the string that Andreid has.

The second line contains the string of length n consisting only from zeros and ones.

Output

Output the minimum length of the string that may remain after applying the described operations several times.

Sample Input

Input

4
1100

Output

0

Input

5
01010

Output

1

Input

8
11101111

Output

6

Sample Output

Hint

In the first sample test it is possible to change the string like the following: .

In the second sample test it is possible to change the string like the following: .

In the third sample test it is possible to change the string like the following: .

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int n, i, x = 0, j, k, y = 0;
    char a[200000];
    scanf("%d", &n);
    getchar();
    for (i = 0;i < n; i++)
    {
        scanf("%c", &a[i]);


    }
    for (i = 0;i < n; i++)
    {
         if (a[i] == '0')
            x++;
        if (a[i] == '1')
            y++;
    }
    j = n - 2 * y;
    k = n - 2 * x;
    if (x == 0 || y == 0)
        printf("%d", n);
    else if (x > y)
    printf("%d\n", j);
    else
        printf("%d\n", k);
    return 0;
}