Array Fill I

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem Statement

Given an integer $V$, construct an integer array $N$ with exactly $10$ elements using

Then print $N_0,N_1,\ldots,N_9$ in order.

Input

One line contains the integer $V$, with $V<50$.

Output

Print exactly $10$ lines. The line for index $i$ has the form N[i] = X, where $X=N_i$.

Subtasks

Subtask 1 (100 points): $-10^9\le V<50$. The lower bound is a Phuoc Hung OJ test bound chosen so every multiplication in this version safely fits in long long.

Examples

Input

1

Output

N[0] = 1
N[1] = 2
N[2] = 4
N[3] = 8
N[4] = 16
N[5] = 32
N[6] = 64
N[7] = 128
N[8] = 256
N[9] = 512

Explanation

For $V=1$, $N_0=1$. Each later element is twice the previous one: $N_1=2$, $N_2=4$, and $N_3=8$. Continuing the same recurrence gives $N_9=512$. Each value is printed with its index.