시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 (추가 시간 없음) 256 MB111100.000%

문제

Steve is a hopeless perfectionist. He's been stumbling upon arrays of positive integers, but he doesn't always enjoy what he's seeing. Steve likes an array if and only if it is strictly ascending. Arrays that Steve doesn't like must be changed asap, otherwise Steve will be disappointed. The new array will satisfy Steve only if its initial length is retained, and its elements are divisible by the corresponding elements of the old array. Note that an array can be satisfactory from the start. In this case, it can be left alone (or not, if you want change).

Make Steve happy! Write a program that can instantly produce new, likeable arrays.

입력

The first line of the input file contains a single integer $n$ --- the number of elements in the array that Steve has laid his eyes on ($2 \le n \le 1000$). The second line of the input file contains $n$ space-separated positive integers $a_i$ ($1 \le a_i \le 10^6$).

출력

In the output file, print $n$ positive integers $a_i$ ($1 \leq a_i \leq 10^9$) --- the new array, which Steve will like.

There can be several solutions: print any of them.

예제 입력 1

7
1 10 5 4 3 2 7

예제 출력 1

1 10 15 20 30 32 35