All Submissions


Let S = { S1 , S2 , . . . . , SK }
where ,

1) Sum(S) = S1 + S2 + ... + SK = N
2) Si != 1 , for all 1 <= i <= K
3) Si divides N , for all 1 <= i <= K

INPUT
Given T , the number of test cases on the first line . The next t lines , consists of a single integer N .

OUTPUT
Output the maximum value of K .

SAMPLE :

INPUT

2
5
6


OUTPUT

1
3


CONSTRAINTS
1<= T <= 10^6
1<= N <= 10^6

PS :
Use Fast I/O .


Problem Setter: Akshit Poddar

Languages: Brain,C,C++,Java,Pascal,Perl,PHP,Python,Ruby,Text

Time Limit: 2 Second(s)
Score: 0 Point(s)
Input File Limit: 50000 Bytes

Submit

Login to post clarification.

No Clarifications.

Contest

Mode Judge

Passive

Online

Overall Rankings

RankNameScore
1xyz0
2Ams0
3TIP0
4team420
5xyzz0
6asdasdasd0
7abcd0
8khankhan0
9Gabriel0
10gigel0