{"raw_statement":[{"iden":"problem statement","content":"Snuke and Raccoon have a heap of $N$ cards. The $i$\\-th card from the top has the integer $a_i$ written on it.\nThey 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.\nLet 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|$."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 2 \\times 10^5$\n*   $-10^{9} \\leq a_i \\leq 10^{9}$\n*   $a_i$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ $...$ $a_{N}$"},{"iden":"sample input 1","content":"6\n1 2 3 4 5 6"},{"iden":"sample output 1","content":"1\n\nIf 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."},{"iden":"sample input 2","content":"2\n10 -10"},{"iden":"sample output 2","content":"20\n\nSnuke 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$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}