eolymp
Problems

Increase by 2

Increase by 2

Time limit 1 second
Memory limit 128 MiB

The sequence of integers is given. Increase by 2 each its non-negative element.

Input data

In the first line the number of sequence elements n~(n \le 100) is given. In the second line the sequence elements are given, each of them does not exceed 100 by absolute value.

Output data

Print n numbers in one line — the new elements of sequence, in the order they were given.

Examples

Input example #1
4
1 2 3 -4
Output example #1
3 4 5 -4
Source SFE-2010 Variant 4