eolymp
bolt
Try our new interface for solving problems
Problems

Increase by 2

Increase by 2

Time limit 1 second
Memory limit 128 MiB

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

Input data

The first line contains the number of elements n~(n \le 100). The second line contains the sequence itself, with each element not exceeding 100 in absolute value.

Output data

Print n integers in a single line — the new elements of the 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