Problem: Mr. Santa asks all the great programmers of the world to solve a trivial problem. He gives them an integer m and asks for the number of positive integers n, such that the factorial of n ends with exactly m zeroes. Are you among those great programmers who can solve this problem?

Input

The only line of input contains an integer m (1 ≤ m ≤ 100 000) — the required number of trailing zeroes in factorial.

Output

First print k — the number of values of n such that the factorial of n ends with m zeroes. Then print these k integers in increasing order.

Examples

Input

1


Output

5
5 6 7 8 9 

Input

5


Output

0

Note

The factorial of n is equal to the product of all integers from 1 to n inclusive, that is n! = 1·2·3·...·n.

In the first sample, 5! = 120, 6! = 720, 7! = 5040, 8! = 40320 and 9! = 362880.

Solution (in JAVA):

Solution:
import java.util.*;

public class a_trivial_problem
{
    public static void main( String[] args )
    {
        Scanner in = new Scanner( System.in );
        int m = in.nextInt(), i = 5 * m, v = Integer.MAX_VALUE;
        for ( i = 5 * m; v > m; i -= 5 )
        {
            v = (int)( Math.floor( i / 5 ) + Math.floor( i / 25 )
                + Math.floor( i / 125 ) + Math.floor( i / 625 )
                + Math.floor( i / 3125 ) + Math.floor( i / 15625 )
                + Math.floor( i / 78125 ) + Math.floor( i / 390625 ) );
        }
        if ( v == m )
        {
            System.out.println( 5 );
            System.out.println( ( i + 5 ) + " " + ( i + 6 ) + " " + ( i + 7 )
                + " " + ( i + 8 ) + " " + ( i + 9 ) );
        }
        else
            System.out.println( 0 );
        in.close();
        System.exit( 0 );
    }
}