CF1006A.Adjacent Replacements

Mishka got an integer array $a$ of length $n$ as a birthday present (what a surprise!).

Mishka doesn't like this present and wants to change it somehow. He has invented an algorithm and called it "Mishka's Adjacent Replacements Algorithm". This algorithm can be represented as a sequence of steps:

• Replace each occurrence of $1$ in the array $a$ with $2$;
• Replace each occurrence of $2$ in the array $a$ with $1$;
• Replace each occurrence of $3$ in the array $a$ with $4$;
• Replace each occurrence of $4$ in the array $a$ with $3$;
• Replace each occurrence of $5$ in the array $a$ with $6$;
• Replace each occurrence of $6$ in the array $a$ with $5$;
• $\dots$
• Replace each occurrence of $10^9 - 1$ in the array $a$ with $10^9$;
• Replace each occurrence of $10^9$ in the array $a$ with $10^9 - 1$.

Note that the dots in the middle of this algorithm mean that Mishka applies these replacements for each pair of adjacent integers ($2i - 1, 2i$) for each $i \in{1, 2, \ldots, 5 \cdot 10^8}$ as described above.

For example, for the array $a = [1, 2, 4, 5, 10]$, the following sequence of arrays represents the algorithm:

$[1, 2, 4, 5, 10]$ $\rightarrow$ (replace all occurrences of $1$ with $2$) $\rightarrow$ $[2, 2, 4, 5, 10]$ $\rightarrow$ (replace all occurrences of $2$ with $1$) $\rightarrow$ $[1, 1, 4, 5, 10]$ $\rightarrow$ (replace all occurrences of $3$ with $4$) $\rightarrow$ $[1, 1, 4, 5, 10]$ $\rightarrow$ (replace all occurrences of $4$ with $3$) $\rightarrow$ $[1, 1, 3, 5, 10]$ $\rightarrow$ (replace all occurrences of $5$ with $6$) $\rightarrow$ $[1, 1, 3, 6, 10]$ $\rightarrow$ (replace all occurrences of $6$ with $5$) $\rightarrow$ $[1, 1, 3, 5, 10]$ $\rightarrow$ $\dots$ $\rightarrow$ $[1, 1, 3, 5, 10]$ $\rightarrow$ (replace all occurrences of $10$ with $9$) $\rightarrow$ $[1, 1, 3, 5, 9]$. The later steps of the algorithm do not change the array.

Mishka is very lazy and he doesn't want to apply these changes by himself. But he is very interested in their result. Help him find it.

米什卡收到了一个长度为 $n$ 的整数数组 $a$ 作为生日礼物（真是个惊喜！）

米什卡不喜欢这份礼物，想对它做些改动。他发明了一种算法，并将其命名为“米什卡的相邻替换算法”。该算法可表示为一系列步骤：

• 将数组 $a$ 中每个出现的 $1$ 替换为 $2$；
• 将数组 $a$ 中每个出现的 $2$ 替换为 $1$；
• 将数组 $a$ 中每个出现的 $3$ 替换为 $4$；
• 将数组 $a$ 中每个出现的 $4$ 替换为 $3$；
• 将数组 $a$ 中每个出现的 $5$ 替换为 $6$；
• 将数组 $a$ 中每个出现的 $6$ 替换为 $5$；
• $\dots$
• 将数组 $a$ 中每个出现的 $10^9 - 1$ 替换为 $10^9$；
• 将数组 $a$ 中每个出现的 $10^9$ 替换为 $10^9 - 1$。

注意：该算法中间的省略号表示米什卡对每一对相邻整数 $(2i - 1, 2i)$（其中 $i \in \{1, 2, \ldots, 5 \cdot 10^8\}$）均按上述方式执行这些替换操作。

例如，对于数组 $a = [1, 2, 4, 5, 10]$，以下数组序列代表了该算法的执行过程：

$[1, 2, 4, 5, 10]$ $\rightarrow$（将所有 $1$ 替换为 $2$）$\rightarrow$ $[2, 2, 4, 5, 10]$ $\rightarrow$（将所有 $2$ 替换为 $1$）$\rightarrow$ $[1, 1, 4, 5, 10]$ $\rightarrow$（将所有 $3$ 替换为 $4$）$\rightarrow$ $[1, 1, 4, 5, 10]$ $\rightarrow$（将所有 $4$ 替换为 $3$）$\rightarrow$ $[1, 1, 3, 5, 10]$ $\rightarrow$（将所有 $5$ 替换为 $6$）$\rightarrow$ $[1, 1, 3, 6, 10]$ $\rightarrow$（将所有 $6$ 替换为 $5$）$\rightarrow$ $[1, 1, 3, 5, 10]$ $\rightarrow$ $\dots$ $\rightarrow$ $[1, 1, 3, 5, 10]$ $\rightarrow$（将所有 $10$ 替换为 $9$）$\rightarrow$ $[1, 1, 3, 5, 9]$。算法后续的步骤不再改变该数组。

米什卡非常懒，不愿亲自执行这些变换。但他对最终结果极为感兴趣。请帮助他找出该结果。

The first line of the input contains one integer number $n$ ($1 \le n \le 1000$) — the number of elements in Mishka's birthday present (surprisingly, an array).

The second line of the input contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$) — the elements of the array.

输入的第一行包含一个整数 $n$（$1 \le n \le 1000$）—— 表示 Mishka 生日礼物中元素的个数（出人意料地，这是一个数组）。

输入的第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 10^9$）—— 表示该数组的元素。

Print $n$ integers — $b_1, b_2, \dots, b_n$, where $b_i$ is the final value of the $i$-th element of the array after applying "Mishka's Adjacent Replacements Algorithm" to the array $a$. Note that you cannot change the order of elements in the array.

输出 $n$ 个整数 — $b_1, b_2, \dots, b_n$，其中 $b_i$ 表示对数组 $a$ 应用“Mishka 的相邻替换算法”后，数组中第 $i$ 个元素的最终值。注意：你不能改变数组中元素的顺序。

The first example is described in the problem statement.

第一个示例在题目描述中已给出。