CASE OF THE ZEROS AND ONES

• Problem 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 Power of 5)), 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.

• CODING ARENA

• #include<stdio.h>

  #include<stdlib.h>

  int main()

  {

  int n,i,c1=0,c0=0;

  char c[200001];

  scanf("%d",&n);

  scanf("%s",c);

  
  

  for(i=0;i<n;i++)

  if(c[i]=='1')

  c1++;

  else

  c0++;

  
  

  printf("%d",abs(c1-c0));

  return 0;

  }

• Test Case 1

  
  Input (stdin)

  8
  
  11101111
  
  

  Expected Output

  6

• Test Case 2

  
  Input (stdin)

  6
  
  110110
  
  

  Expected Output

  2