Lowest Number and Position

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem Statement

Given an integer array $X=(x_0,x_1,\ldots,x_{n-1})$, find the smallest value and its $0$-based index.

All input values are distinct, so the minimum position is unique.

Input

• The first line contains an integer $n$.
• The second line contains $n$ integers $x_0,x_1,\ldots,x_{n-1}$.

Output

Print exactly two lines:

• Menor valor: v, where $v$ is the minimum value;
• Posicao: p, where $p$ is the $0$-based index of $v$.

The spelling, capitalization, colon, and lack of accents in these two labels must be preserved exactly.

Subtasks

Subtask 1 (100 points): $2\le n\le999$; $-10^9\le x_i\le10^9$; all values are pairwise distinct.

Examples

Input

10
1 2 3 4 -5 6 7 8 9 10

Output

Menor valor: -5
Posicao: 4

Explanation

The minimum value is $-5$. It is stored at index $4$ when using $0$-based indexing, so the two output lines are Menor valor: -5 and Posicao: 4.