Statistics (Statistics)

Source: Problem Solving and Program Design in C

Version: Phuoc Hung OJ Extended

Problem

The input contains multiple data sets until EOF. Each data set is one line containing $n$ followed by $a_0,\ldots,a_{n-1}$.

For case $c$ starting from $1$, compute

and

Thus $p$ is the first maximum position and $q$ the last minimum position. Indices are 0-based.

Input

Each line is one data set: n a_0 a_1 ... a_{n-1}. Read until EOF.

Output

For case $c$, print Case c: m M R p q.

Subtask

Subtask 1 (20 points): Mỗi file có không quá $3$ bộ; $1\le n\le10$, $|a_i|\le10^3$.

Subtask 2 (30 points): Mỗi file có không quá $20$ bộ; $1\le n\le100$, $|a_i|\le10^6$.

Subtask 3 (50 points): Mỗi file có không quá $50$ bộ; $1\le n\le1000$, $|a_i|\le10^9$.

Example

Input

5 3 1 8 8 1
4 -2 -2 -2 5

Output

Case 1: 1 8 7 2 4
Case 2: -2 5 7 3 2

Explanation

The sample follows the definitions and rules above.