Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 3.0 Seconds Memory Limit: 65536K Special Judge

Total Runs: 793 Accepted Runs: 198 Multiple test files

Case Time Limit: 1.0 Seconds

Bill is developing a new mathematical theory for human emotions. His recent investigations are dedicated
to studying how good or bad days influent people's memories about some period of life.
### Input

### Output

### Sample Input

### Sample Output

A new idea Bill has recently developed assigns a non-negative integer value to each day of human life.
Bill calls this value the *emotional value* of the day. The greater the emotional value is, the better the day
was. Bill suggests that the value of some period of human life is proportional to the sum of the emotional
values of the days in the given period, multiplied by the smallest emotional value of the day in it. This
schema reflects that good on average period can be greatly spoiled by one very bad day.

Now Bill is planning to investigate his own life and find the period of his life that had the greatest value. Help him to do so.

The first line of the input contains *n* — the number of days of Bill's life he is planning to investigate
(1 ≤ *n* ≤ 100 000). The rest of the input contains *n* integer numbers *a*_{1}, *a*_{2}, ... *a _{n}* ranging from 0 to 10

On the first line of the output print the greatest value of some period of Bill's life.

On the second line print two numbers *l* and *r* such that the period from *l*-th to *r*-th day of Bill's life
(inclusive) has the greatest possible value. If there are multiple periods with the greatest possible value,
then print any one of them.

6 3 1 6 4 5 2

60 3 5

**Note:** Special judge problem, you may get "Wrong Answer" when output in wrong format.

Maintance:G.D.Retop. Developer: SuperHacker, G.D.Retop