Array Replacement I

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem Statement

You are given an integer array $X$ containing exactly $10$ elements indexed from $0$ through $9$. For each element $X_i$:

• if $X_i\le0$, replace it with $1$;
• if $X_i>0$, keep it unchanged.

After all $10$ elements have been processed, print the complete array in the required format.

Input

The input contains exactly $10$ integers $X_0,X_1,\ldots,X_9$. Values may be positive, negative, or zero.

Output

Print exactly $10$ lines. For each $i$ from $0$ through $9$, print X[i] = v, where $v$ is the value of $X_i$ after replacement.

Subtasks

Subtask 1 (100 points): every input value is in $[-10^9,10^9]$. This numeric bound is part of the Phuoc Hung OJ test configuration; the original replacement rule is unchanged.

Examples

Input

0
-5
63
0
8
-1
7
2
-3
10

Output

X[0] = 1
X[1] = 1
X[2] = 63
X[3] = 1
X[4] = 8
X[5] = 1
X[6] = 7
X[7] = 2
X[8] = 1
X[9] = 10

Explanation

Process the elements in index order. $X_0=0$ and $X_1=-5$ are non-positive, so both become $1$. $X_2=63$ is positive and remains unchanged. $X_3=0$ becomes $1$. The same rule is applied to every remaining position, and each output line reports the transformed value at that index.