#CCBCHBAHAI0000026. Array change I

Array change I

Array change I

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem

You are given an array NN containing exactly 2020 integers, indexed from 00 through 1919.

Reverse the array by swapping symmetric pairs:

N[i]↔N[19−i](0≤i<10).N[i]\leftrightarrow N[19-i]\qquad(0\le i<10).

After all swaps, print the complete array in increasing index order. Each line must have exactly the form

N[i] = value

where i is the index and value is the value stored at that index after the reversal.

Input

The input contains exactly 2020 lines. Line i+1i+1 contains integer N[i]N[i] for 0≤i<200\le i<20.

Output

Print exactly 2020 lines. For every 0≤i<200\le i<20, print N[i] = value using the array value after reversal.

Subtasks

Subtask 1 (100 points): Exactly 2020 integers are given; ∣Ni∣≤109|N_i|\le 10^9.

Example

Input

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

Output

N[0] = 20
N[1] = 19
N[2] = 18
N[3] = 17
N[4] = 16
N[5] = 15
N[6] = 14
N[7] = 13
N[8] = 12
N[9] = 11
N[10] = 10
N[11] = 9
N[12] = 8
N[13] = 7
N[14] = 6
N[15] = 5
N[16] = 4
N[17] = 3
N[18] = 2
N[19] = 1

Explanation

After swapping N[i]N[i] with N[19−i]N[19-i] for 0≤i<100\le i<10, all 20 elements appear in reverse order.