Problem:
Score : 300 points

Problem 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|.

Constraints

2 \leq N \leq 2 \times 10^5

-10^{9} \leq a_i \leq 10^{9}

a_i is an integer.

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 ... a_{N}

Output

Print the answer.

Sample Input 1

6
1 2 3 4 5 6

Sample Output 1

1

If Snuke takes four cards from the top, and Raccoon takes the remaining two cards, x=10, y=11, and thus |x-y|=1. This is the minimum possible value.

Sample Input 2

2
10 -10

Sample Output 2

20

Snuke can only take one card from the top, and Raccoon can only take the remaining one card. In this case, x=10, y=-10, and thus |x-y|=20.

Solution in Haskell (GHC 7.10.3) (judge verdict: Accepted)

import qualified Data.IntSet as S
import Data.List
import Control.Monad
import Data.Maybe
 
main = do
 getLine
 ls <- map read. words <$> getLine
 let als = scanl1 (+) (init ls)
 let als' = scanr1 (+) (tail ls)
 let s1 = S.fromList als
 let s2 = S.fromList als'
 let med = div (sum ls) 2
 print $ pile s1 s2 med
 
pile s1 s2 med = min (abs (hi-lo)) (abs (hi'-lo'))
 where
  lo = maybe 0 id (S.lookupLE med s1)
  hi = maybe (maxBound :: Int) id (S.lookupGE med s2)
  lo' = maybe 0 id (S.lookupGE med s1)
  hi' = maybe (maxBound :: Int) id (S.lookupLE med s2)