|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||2||2||2||100.000%|
A factorial of a positive integer n (which is noted as n!) is multiplication of all integers from 1 till n: n!=1×2×3×...×n. What is the least number of factorials to be cut out of multiplication of the first k factorials 1!×2!×3!×...×k! so that the multiplication of remaining factorials will be the square of a some integer ?
From the keyboard the value of k (2 ≤ k ≤ 500) is input.
You must output in the increasing order the values of the numbers whose factorials have to be be cut out. If there are several solutions, you must output just one of them.