Codeforces Solution-A. Adjacent Replacements-Solution in C, C++, Java, Python

Algorithm

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 ( $2 i - 1, 2 i$ ) for each $i \in {1, 2, \dots, 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]$ $\to$ (replace all occurrences of $1$ with $2$ ) $\to$ $[2, 2, 4, 5, 10]$ $\to$ (replace all occurrences of $2$ with $1$ ) $\to$ $[1, 1, 4, 5, 10]$ $\to$ (replace all occurrences of $3$ with $4$ ) $\to$ $[1, 1, 4, 5, 10]$ $\to$ (replace all occurrences of $4$ with $3$ ) $\to$ $[1, 1, 3, 5, 10]$ $\to$ (replace all occurrences of $5$ with $6$ ) $\to$ $[1, 1, 3, 6, 10]$ $\to$ (replace all occurrences of $6$ with $5$ ) $\to$ $[1, 1, 3, 5, 10]$ $\to$ $\dots$ $\to$ $[1, 1, 3, 5, 10]$ $\to$ (replace all occurrences of $10$ with $9$ ) $\to$ $[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.

Input

The first line of the input contains one integer number $n$ ( $1 \leq n \leq 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 \leq a_{i} \leq 10^{9}$ ) — the elements of the array.

Output

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.

Examples
input
Copy
5
1 2 4 5 10
output
Copy
1 1 3 5 9
input
Copy
10
10000 10 50605065 1 5 89 5 999999999 60506056 1000000000
output
Copy
9999 9 50605065 1 5 89 5 999999999 60506055 999999999

Note

The first example is described in the problem statement.

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int const N = 1001;
int n, a[N];

int main() {
  cin >> n;
  for(int i = 0; i < n; ++i)
    cin >> a[i];
  
  for(int i = 0; i < n; ++i)
    printf("%s%d", i == 0 ? "" : " ", a[i] - (a[i] % 2 == 0));
  puts("");
  
  return 0;
}

Copy The Code & Try With Live Editor

Input

–

cmd

5
1 2 4 5 10

Output

–

cmd

1 1 3 5 9

Demonstration

Codeforces Solution-A. Adjacent Replacements-Solution in C, C++, Java, Python,Adjacent Replacements,Codeforces Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution

Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+

Try With Live Editor

Category - Codeforces Online Judge Maniruzzaman Akash 1 year ago 316 0