public int minimumSum(n)
{
      int counter1, counter2, minimumSum;
     
      counter1 = n;
      counter2 = n-1;
      int i = n-2;
      while(i>0)
      {
          if(counter1 > counter2)
          { 
              counter2 = counter2 + array[i];
          }
          else
          {
              counter1 = counter1 + array[i];
          }
          i--;
      }
      if(counter1 > counter2)
      {
          minimumSum = counter1 - counter2;
      }
      else
          minimumSum = counter2 - counter1;
      return minimumSum ;
}