eolymp
Competitions

Week 3: November 23 – 29. For Loop. Part 1

Smallest divisor

For a given positive integer n print its smallest divisor other than 1.

Input

One positive integer n (1 < n < 231).

Output

Print the smallest divisor of n other than 1.

Time limit 1 second
Memory limit 128 MiB
Input example #1
21
Output example #1
3
Author Matviychuk Sergiy Volodymyrovych
Source "ABC programming"