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:
//   package Practise;

/**
 * Created by Rahul on 6/21/2016.
 */
import java.io.*;
public class trivial_problem633b {
    public static void main(String[] arg)throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int m, k, n;
        int i, temp;
        m = Integer.parseInt(br.readLine());
        //int t=-1;
        int cnt=-1;
         n=-1;
        while(cnt<m)
        {
            n=n+5;
            if((n-4)%25==0&&n>4)
            {
                cnt+= 2;
                //  System.out.println("hii1");

                if((n-4)%125==0&&n>4)
                {
                cnt++;
                 }
                if((n-4)%625==0&&n>4)
                {
                    cnt++;
                }
                if((n-4)%3125==0&&n>4)
                {
                    cnt++;
                }
                if((n-4)%15625==0&&n>4)
                {
                    cnt++;
                }
                if((n-4)%78125==0&&n>4)
                {
                    cnt++;
                }
                if((n-4)%390625==0&&n>4)
                {
                    cnt++;
                }
                if((n-4)%1953125==0&&n>4)
                {
                    cnt++;
                }
                if((n-4)%9765625==0&&n>4)
                {
                    cnt++;
                }

            }
            else
            {
                cnt++;
               // System.out.println("hii");
            }
        }
        if(cnt==m)
        {
            System.out.println("5");
            for(i=n-4;i<=n;i++)
            {
                System.out.print(i+" ");
            }
        }
        else
        {
            System.out.println("0");
        }



    }

}