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?
The only line of input contains an integer *m* (1 ≤ *m* ≤ 100 000) — the required number of trailing zeroes in factorial.
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.
1
5
5 6 7 8 9 
5
0
2
5
10 11 12 13 14 
3
5
15 16 17 18 19 
7
5
30 31 32 33 34 
12
5
50 51 52 53 54 
15
5
65 66 67 68 69 
18
5
75 76 77 78 79 
38
5
155 156 157 158 159 
47
5
195 196 197 198 199 
58
5
240 241 242 243 244 
66
5
270 271 272 273 274 
70
5
285 286 287 288 289 
89
5
365 366 367 368 369 
417
5
1675 1676 1677 1678 1679 
815
5
3265 3266 3267 3268 3269 
394
5
1585 1586 1587 1588 1589 
798
0
507
5
2035 2036 2037 2038 2039 
406
5
1630 1631 1632 1633 1634 
570
5
2290 2291 2292 2293 2294 
185
0
765
0
967
0
112
5
455 456 457 458 459 
729
5
2925 2926 2927 2928 2929 
4604
5
18425 18426 18427 18428 18429 
8783
5
35140 35141 35142 35143 35144 
1059
0
6641
5
26575 26576 26577 26578 26579 
9353
5
37425 37426 37427 37428 37429 
1811
5
7250 7251 7252 7253 7254 
2528
0
8158
5
32640 32641 32642 32643 32644 
3014
5
12070 12071 12072 12073 12074 
7657
5
30640 30641 30642 30643 30644 
4934
0
9282
5
37140 37141 37142 37143 37144 
2610
5
10450 10451 10452 10453 10454 
2083
5
8345 8346 8347 8348 8349 
26151
5
104620 104621 104622 104623 104624 
64656
5
258640 258641 258642 258643 258644 
46668
5
186690 186691 186692 186693 186694 
95554
5
382235 382236 382237 382238 382239 
37320
0
52032
5
208140 208141 208142 208143 208144 
11024
5
44110 44111 44112 44113 44114 
63218
5
252885 252886 252887 252888 252889 
40095
5
160390 160391 160392 160393 160394 
42724
5
170910 170911 170912 170913 170914 
24381
5
97530 97531 97532 97533 97534 
73138
5
292570 292571 292572 292573 292574 
93346
5
373400 373401 373402 373403 373404 
18338
5
73370 73371 73372 73373 73374 
42662
5
170660 170661 170662 170663 170664 
81221
5
324900 324901 324902 324903 324904 
100000
5
400005 400006 400007 400008 400009 
100000
5
400005 400006 400007 400008 400009 
99998
0
30
0
11
0
780
0
97656
5
390625 390626 390627 390628 390629 
12499
5
50000 50001 50002 50003 50004 
65
5
265 266 267 268 269 
41
5
170 171 172 173 174 
31
5
125 126 127 128 129 
86577
0
from math import factorial

n = int(input())
total = 0
i = 5
numbers = ""
while True:
    nb = factorial(i)
    if nb % 10 ** (n + 1) == 0:
        break
    elif nb % 10 ** n == 0:
        total += 1
        numbers += str(i) + " "
    i += 1
if total == 0:
    print(0)
else:
    print(total)
    print(numbers)