Print with 0-Based Indices

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

You are given an integer array $a$ of length $n$, indexed from $0$ to $n-1$. For every index $i$, print the index together with the value $a_i$ stored at that index.

Input

• The first line contains the integer $n$, the number of array elements.
• The second line contains exactly $n$ integers $a_0,a_1,\ldots,a_{n-1}$ in increasing index order.

Output

Print exactly $n$ lines. Line $i+1$ contains $i$ and $a_i$, separated by one space.

Subtasks

Subtask 1 (20 points): $n=1$, $-9 \le a_0 \le 9$.

Subtask 2 (30 points): $2 \le n \le 20$, $0 \le a_i \le 10^4$ for every $0 \le i<n$.

Subtask 3 (50 points): $1 \le n \le 1000$, $-10^9 \le a_i \le 10^9$ for every $0 \le i<n$.

Examples

Input

4
12 -5 7 7

Output

0 12
1 -5
2 7
3 7

Explanation

The four array entries are $a_0=12$, $a_1=-5$, $a_2=7$, and $a_3=7$. Therefore the required index-value pairs are 0 12, 1 -5, 2 7, and 3 7.