Problem description

.desc_header { margin-bottom: 2em; text-align: center; } .desc_title { font-size: 200%; text-decoration: underline; padding: 0em 0.2em; display: inline-block; } .desc_code { padding: 0em 0.2em; font-weight: bold; display: inline-block; } .desc_meta { margin: 0.5em; } .desc_memlimit { padding: 0em 1.25em; display: inline-block; } .desc_timelimit { padding: 0em 1.25em; display: inline-block; } .desc .example-test { width: 100%; margin-top: 10px; } .desc .example-test td { vertical-align: top; } .desc .example-test pre { margin-top: 5px; } Divisors, inversed (dzielniki-na-odwrot) Memory limit: 32 MB Time limit: 0.50 s Write a program, which reads a positive integer N and finds the smallest positive integer M having exactly M divisors and writes the result to standard output. Input In the first (and the only one) line of the standard input there is one positive integer N. Output In the first (and the only one) line of the standard output there should be one positive integer M – the smallest positive integer having exactly N divisors. If M > 1017, NIE (the Polish for NO) should be printed. Limits 1 ≤ N ≤ 100 000. Example Input Output 4 6