#P17699. [ICPC 2019 Nanjing R] A Hard Problem
[ICPC 2019 Nanjing R] A Hard Problem
Problem Description
Given a positive integer , you need to find out the minimum integer such that for any subset of the set of size , there exist two different integers that is a factor of .
Input Format
The first line contains an integer indicating the number of test cases.
Each of the following lines contains an integer describing a test case.
Output Format
For each test case, output a line containing an integer which indicates the answer.
4
2
3
4
5
2
3
3
4