|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||0||0||0||0.000%|
Let n be a positive integer. George wrote a program which finds positive integers a1, a2, …, ak, which product increases n times if we add 1 to each of them, i.d.
(a1+1)(a2+1)...(ak+1) = na1a2...ak.
Now, however, he wants to find out what’s the smallest value of k, for which this is possible. Write a program mink, which solves the George’s new task.
From the first line of the standard input it is given n (2 < n < 1000).
On a line of the standard output the program must write the searched value of k.