Square Function

아직 제출이 없습니다시간 제한2초메모리 제한256 MB

문제

Let us define function SS: NN\mathbb{N} \rightarrow \mathbb{N} in the following way: S(x)S(x) is the minimum number for which there exists an increasing sequence of integers x=t_1<t_2<<t_k=S(x)x = t\_{1} < t\_{2} < \ldots < t\_{k} = S(x) such that t_1t_2t_kt\_{1} \cdot t\_{2} \cdot \ldots \cdot t\_{k} is a square of some integer. For example, S(2)=6S(2) = 6, S(3)=8S(3) = 8, S(4)=4S(4) = 4.

Given yy, find all such xx that S(x)=yS(x)=y.

입력

The only line of input contains a single integer yy (1y1061 \le y \le 10^{6}).

출력

On the first line, print the number of solutions. On the second line, list all solutions in increasing order separated by spaces.

힌트

N\mathbb{N} is the set of positive integers.