CF18C.Stripe

Once Bob took a paper stripe of n squares (the height of the stripe is 1 square). In each square he wrote an integer number, possibly negative. He became interested in how many ways exist to cut this stripe into two pieces so that the sum of numbers from one piece is equal to the sum of numbers from the other piece, and each piece contains positive integer amount of squares. Would you help Bob solve this problem?

曾经，鲍勃拿了一条由 $n$ 个方格组成的纸带（纸带高度为 1 个方格）。他在每个方格中写下一个整数（可能为负数）。他开始好奇：有多少种方法可以将这条纸带切成两段，使得其中一段所有数字之和等于另一段所有数字之和，并且每一段都必须包含正整数个方格？你愿意帮鲍勃解决这个问题吗？

The first input line contains integer n (1 ≤ n ≤ 105) — amount of squares in the stripe. The second line contains n space-separated numbers — they are the numbers written in the squares of the stripe. These numbers are integer and do not exceed 10000 in absolute value.

第一行输入包含一个整数 $n$（$1 \leq n \leq 10^5$）—— 表示条带中正方形的数量。
第二行包含 $n$ 个以空格分隔的数字——它们是条带中各个正方形上所写的数字。这些数字均为整数，且其绝对值不超过 $10000$。

Output the amount of ways to cut the stripe into two non-empty pieces so that the sum of numbers from one piece is equal to the sum of numbers from the other piece. Don't forget that it's allowed to cut the stripe along the squares' borders only.

输出将该条带切割成两个非空部分的方法数，使得其中一部分的数字之和等于另一部分的数字之和。注意：只允许沿方格的边界进行切割。