Sum

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

Description

There is a number sequence ${A}_{1},{A}_{2}....{A}_{n}$,you can select a interval [l,r] or not,all the numbers ${A}_{i}(l \leq i \leq r)$ will become $f({A}_{i})$.$f(x)=(1890x+143) mod 10007$.After that,the sum of n numbers should be as much as possible.What is the maximum sum?

Input

There are multiple test cases.
First line of each case contains a single integer n.$(1\leq n\leq {10}^{5})$
Next line contains n integers ${A}_{1},{A}_{2}....{A}_{n}$.$(0\leq {A}_{i}\leq {10}^{4})$
It's guaranteed that $\sum n\leq {10}^{6}$.

Output

For each test case,output the answer in a line.

Sample Input

2 10000 9999 5 1 9999 1 9999 1

Sample Output

19999 22033

Hint

hujie

Source

BestCoder Round #64 (div.2)

提交代码