Problem Statement

We have a circular pizza.
Takahashi will cut this pizza using a sequence $A$ of length $N$, according to the following procedure.

• First, make a cut from the center in the $12$ o'clock direction.
• Next, do $N$ operations. The $i$-th operation is as follows.
  • Rotate the pizza A_iAi degrees clockwise.
  • Then, make a cut from the center in the $12$ o'clock direction.

For example, if $A=(90,180,45,195)$, the procedure cuts the pizza as follows.

Find the center angle of the largest pizza after the procedure.

Constraints

• All values in input are integers.
• $1\le N\le 359$
• 1 \le A_i \le 3591≤Ai≤359
• There will be no multiple cuts at the same position.

$N$A_1A1A_2A2$\dots$A_NAN