The Next Prime

Given an integer $n$ ($0 \le n \le 4 \times 10^9$), write a program that finds the smallest prime number that is greater than or equal to $n$.

The first line contains the number of test cases. Each test case consists of a single line containing one integer $n$.

For each test case, print the smallest prime that is greater than or equal to $n$, one per line.