CF959D Mahmoud and Ehab and another array construction task

Mahmoud has an array $ a $ consisting of $ n $ integers. He asked Ehab to find another array $ b $ of the same length such that: - $ b $ is lexicographically greater than or equal to $ a $ . - $ b_{i}>=2 $ . - $ b $ is pairwise coprime: for every $ 1

The first line contains an integer $ n $ $ (1

Output $ n $ space-separated integers, the $ i $ -th of them representing $ b_{i} $ .

Note that in the second sample, the array is already pairwise coprime so we printed it.