Let us define function S: N→N in the following way: S(x) is the minimum number for which there exists an increasing sequence of integers x=t_1<t_2<…<t_k=S(x) such that t_1⋅t_2⋅…⋅t_k is a square of some integer. For example, S(2)=6, S(3)=8, S(4)=4.
Given y, find all such x that S(x)=y.
The only line of input contains a single integer y (1≤y≤106).
On the first line, print the number of solutions. On the second line, list all solutions in increasing order separated by spaces.
N is the set of positive integers.