Score: 200 points
Takahashi, who works at DISCO, is standing before an iron bar. The bar has N-1 notches, which divide the bar into N sections. The i-th section from the left has a length of A_i millimeters.
Takahashi wanted to choose a notch and cut the bar at that point into two parts with the same length. However, this may not be possible as is, so he will do the following operations some number of times before he does the cut:
Find the minimum amount of money needed before cutting the bar into two parts with the same length.
Input is given from Standard Input in the following format:
N A_1 A_2 A_3 ... A_N
Print an integer representing the minimum amount of money needed before cutting the bar into two parts with the same length.
3 2 4 3
3
The initial lengths of the sections are [2, 4, 3] (in millimeters). Takahashi can cut the bar equally after doing the following operations for 3 yen:
12 100 104 102 105 103 103 101 105 104 102 104 101
0