Limak is an old brown bear. He often goes bowling with his friends. Today he feels really good and tries to beat his own record!

For rolling a ball one gets a score − an integer (maybe negative) number of points. Score for the i-th roll is multiplied by i and scores are summed up. So, for k rolls with scores s₁,s₂,...,s_k, the total score is . The total score is 0 if there were no rolls.

Limak made n rolls and got score a_i for the i-th of them. He wants to maximize his total score and he came up with an interesting idea. He can say that some first rolls were only a warm-up, and that he wasn't focused during the last rolls. More formally, he can cancel any prefix and any suffix of the sequence a₁,a₂,...,a_n. It is allowed to cancel all rolls, or to cancel none of them.

The total score is calculated as if there were only non-canceled rolls. So, the first non-canceled roll has score multiplied by 1, the second one has score multiplied by 2, and so on, till the last non-canceled roll.

What maximum total score can Limak get?

The first line contains a single integer n (1≤n≤2·10⁵) − the total number of rolls made by Limak.

The second line contains n integers a₁,a₂,...,a_n (|a_i|≤10⁷) − scores for Limak's rolls.

Print the maximum possible total score after cancelling rolls.