SP3587 PAGAIN - Prime Again

[English](/problems/PAGAIN/en/) [Vietnamese](/problems/PAGAIN/vn/)In this problem, you have to find the nearest prime number smaller than N. (3

The first line contains an integer T specifying the number of test cases. (T

For each test case, output the result on one line.