{"raw_statement":[{"iden":"problem statement","content":"Snuke has an integer sequence $A$ of length $N$.\nHe will make three cuts in $A$ and divide it into four (non-empty) contiguous subsequences $B, C, D$ and $E$. The positions of the cuts can be freely chosen.\nLet $P,Q,R,S$ be the sums of the elements in $B,C,D,E$, respectively. Snuke is happier when the absolute difference of the maximum and the minimum among $P,Q,R,S$ is smaller. Find the minimum possible absolute difference of the maximum and the minimum among $P,Q,R,S$."},{"iden":"constraints","content":"*   $4 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq A_i \\leq 10^9$\n*   All values in input are integers."},{"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":"5\n3 2 4 1 2"},{"iden":"sample output 1","content":"2\n\nIf we divide $A$ as $B,C,D,E=(3),(2),(4),(1,2)$, then $P=3,Q=2,R=4,S=1+2=3$. Here, the maximum and the minimum among $P,Q,R,S$ are $4$ and $2$, with the absolute difference of $2$. We cannot make the absolute difference of the maximum and the minimum less than $2$, so the answer is $2$."},{"iden":"sample input 2","content":"10\n10 71 84 33 6 47 23 25 52 64"},{"iden":"sample output 2","content":"36"},{"iden":"sample input 3","content":"7\n1 2 3 1000000000 4 5 6"},{"iden":"sample output 3","content":"999999994"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}