output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 a_2 ... a_{N}
attempt: N, x = int(input()), 0
  s = list(map(int, input().split()))
  for j in s:
      x += j
  x = x - s[0] * 2
  ans = x
  for k in range(1, N - 1):
      x = x - s[k] * 2
      ans = min(ans, abs(x))
  print(ans)
  
problem_description: Statement
  
  Snuke and Raccoon have a heap of N cards. The i-th card from the top has the
  integer a_i written on it.
  
  They will share these cards. First, Snuke will take some number of cards from
  the top of the heap, then Raccoon will take all the remaining cards. Here,
  both Snuke and Raccoon have to take at least one card.
  
  Let the sum of the integers on Snuke's cards and Raccoon's cards be x and y,
  respectively. They would like to minimize |x-y|. Find the minimum possible
  value of |x-y|.
samples: [{"input": "6\n    1 2 3 4 5 6", "output": "1\n    \n\nIf Snuke takes four cards from the top, and Raccoon takes the remaining two\ncards, x=10, y=11, and thus |x-y|=1. This is the minimum possible value.\n\n* * *"}, {"input": "2\n    10 -10", "output": "20\n    \n\nSnuke can only take one card from the top, and Raccoon can only take the\nremaining one card. In this case, x=10, y=-10, and thus |x-y|=20."}]