output_description: Print the minimum necessary count of operations.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      n
      a_1 a_2 ... a_n
attempt: n = int(input())
  l = map(int, input().split())
  ll = []
  for q in range(len(l)):
      ll.append(l[q])
  print(ll)
  
  sums1 = [0] * n
  count1 = 0
  sums1[0] = ll[0]
  for i in range(1, len(ll)):
      sums1[i] = sums1[i - 1] + ll[i]
  
  
  if l[0] == 0:
      for v in range(len(sums1)):
          sums1 += [1] * len(sums1)
      count1 += 1
  
  for k in range(1, len(sums1)):
      while sums1[k] == 0 or sums1[k] * sums1[k - 1] > 0:
          if sums1[k] == 0:
              for p in range(k, len(sums1)):
                  sums1[p] += -(sums1[k - 1] / abs(sums1[k - 1]))
              count1 += 1
          if sums1[k] * sums1[k - 1] > 0:
              for p in range(k, len(sums1)):
                  sums1[p] += (abs(sums1[k]) + 1) * (-(sums1[k]) / abs(sums1[k]))
              count1 += abs(sums1[k]) + 1
  
  
  sums2 = [0] * n
  count2 = 0
  sums2[0] = ll[0]
  for i in range(1, len(ll)):
      sums2[i] = sums2[i - 1] + ll[i]
  
  
  if l[0] == 0:
      for v in range(len(sums2)):
          sums2 -= [1] * len(sums2)
      count2 += 1
  
  for k in range(1, len(sums2)):
      while sums2[k] == 0 or sums2[k] * sums2[k - 1] > 0:
          if sums2[k] == 0:
              for p in range(k, len(sums2)):
                  sums2[p] += -sums2[k - 1] / abs(sums2[k - 1])
              count2 += 1
          if sums2[k] * sums2[k - 1] > 0:
              for p in range(k, len(sums1)):
                  sums2[p] += -(abs(sums2[k]) + 1) * ((sums2[k]) / abs(sums2[k]))
              count2 += abs(sums1[k]) + 1
  
  
  print(min(count2, count2) * 2)
  
problem_description: Statement
  
  You are given an integer sequence of length N. The i-th term in the sequence
  is a_i. In one operation, you can select a term and either increment or
  decrement it by one.
  
  At least how many operations are necessary to satisfy the following
  conditions?
  
    * For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
    * For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
samples: [{"input": "4\n    1 -3 1 0", "output": "4\n    \n\nFor example, the given sequence can be transformed into 1, -2, 2, -2 by four\noperations. The sums of the first one, two, three and four terms are 1, -1, 1\nand -1, respectively, which satisfy the conditions.\n\n* * *"}, {"input": "5\n    3 -6 4 -5 7", "output": "0\n    \n\nThe given sequence already satisfies the conditions.\n\n* * *"}, {"input": "6\n    -1 4 3 2 -5 4", "output": "8"}]