No tag edit access

A. Pizza Separation

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputStudents Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into *n* pieces. The *i*-th piece is a sector of angle equal to *a*_{i}. Vasya and Petya want to divide all pieces of pizza into two continuous sectors in such way that the difference between angles of these sectors is minimal. Sector angle is sum of angles of all pieces in it. Pay attention, that one of sectors can be empty.

Input

The first line contains one integer *n* (1 ≤ *n* ≤ 360) — the number of pieces into which the delivered pizza was cut.

The second line contains *n* integers *a*_{i} (1 ≤ *a*_{i} ≤ 360) — the angles of the sectors into which the pizza was cut. The sum of all *a*_{i} is 360.

Output

Print one integer — the minimal difference between angles of sectors that will go to Vasya and Petya.

Examples

Input

4

90 90 90 90

Output

0

Input

3

100 100 160

Output

40

Input

1

360

Output

360

Input

4

170 30 150 10

Output

0

Note

In first sample Vasya can take 1 and 2 pieces, Petya can take 3 and 4 pieces. Then the answer is |(90 + 90) - (90 + 90)| = 0.

In third sample there is only one piece of pizza that can be taken by only one from Vasya and Petya. So the answer is |360 - 0| = 360.

In fourth sample Vasya can take 1 and 4 pieces, then Petya will take 2 and 3 pieces. So the answer is |(170 + 10) - (30 + 150)| = 0.

Picture explaning fourth sample:

Both red and green sectors consist of two adjacent pieces of pizza. So Vasya can take green sector, then Petya will take red sector.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/28/2020 14:40:57 (i3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|