Question

You are given an array A of N elements. You divide this array into 4 non-empty
contiguous subsequences B C D E by making 3 cuts to it. Let P, Q, R, S be the sum
of elements in the new arrays B.C.D.E.


Your task is to find the minimum possible absolute difference of the( maximum and the
minimum among P Q R S).


Input Format
The first line contains an integer,N, denoting the number of elements in A.
Each line i of the N subsequent lines (Where 0 <=i<N) contains an integer describing
A[i]


Constraints
4 <= N <= 10^5
1 <= A[<= 10^4​

Answer 1

area of 1 =100hihuu777u7uu8u