from collections import defaultdict

from itertools import product, groupby

from math import pi

from collections import deque

from bisect import bisect, bisect_left, bisect_right

INF = 10 ** 20





def main():

    N = int(eval(input()))

    a_list = list(map(int, input().split()))

    total = sum(a_list)



    dp1 = [0] * N

    dp1[0] = a_list[0]

    for i in range(1, N):

        dp1[i] = a_list[i] + dp1[i - 1]



    ans = INF

    for i in range(N - 1):

        ans = min(ans, abs(dp1[i] - (total - dp1[i])))

    print(ans)





if __name__ == '__main__':

    main()

from collections import defaultdict, Counter

from itertools import product, groupby, count, permutations, combinations

from math import pi, sqrt

from collections import deque

from bisect import bisect, bisect_left, bisect_right

from string import ascii_lowercase

from functools import lru_cache

import sys

sys.setrecursionlimit(10000)

INF = float("inf")

YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"

dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]

dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]





def inside(y, x, H, W):

    return 0 <= y < H and 0 <= x < W





def ceil(a, b):

    return (a + b - 1) // b





def main():

    N = int(eval(input()))

    A = list(map(int, input().split()))



    ans = INF

    total = sum(A)

    now = 0

    for i in range(N - 1):

        now += A[i]

        ans = min(ans, abs((total - now) - now))

    print(ans)





if __name__ == '__main__':

    main()

from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right

INF = 10**20


def main():
    N = int(eval(input()))
    a_list = list(map(int, input().split()))
    total = sum(a_list)
    dp1 = [0] * N
    dp1[0] = a_list[0]
    for i in range(1, N):
        dp1[i] = a_list[i] + dp1[i - 1]
    ans = INF
    for i in range(N - 1):
        ans = min(ans, abs(dp1[i] - (total - dp1[i])))
    print(ans)


if __name__ == "__main__":
    main()

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys

sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def main():
    N = int(eval(input()))
    A = list(map(int, input().split()))
    ans = INF
    total = sum(A)
    now = 0
    for i in range(N - 1):
        now += A[i]
        ans = min(ans, abs((total - now) - now))
    print(ans)


if __name__ == "__main__":
    main()

-from collections import defaultdict -from itertools import product, groupby -from math import pi +from collections import defaultdict, Counter +from itertools import product, groupby, count, permutations, combinations +from math import pi, sqrt +from string import ascii_lowercase +from functools import lru_cache +import sys -INF = 10**20 +sys.setrecursionlimit(10000) +INF = float("inf") +YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no" +dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0] +dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1] + + +def inside(y, x, H, W): +    return 0 <= y < H and 0 <= x < W + + +def ceil(a, b): +    return (a + b - 1) // b -    a_list = list(map(int, input().split())) -    total = sum(a_list) -    dp1 = [0] * N -    dp1[0] = a_list[0] -    for i in range(1, N): -        dp1[i] = a_list[i] + dp1[i - 1] +    A = list(map(int, input().split())) +    total = sum(A) +    now = 0 -        ans = min(ans, abs(dp1[i] - (total - dp1[i]))) +        now += A[i] +        ans = min(ans, abs((total - now) - now))