eolymp
bolt
Try our new interface for solving problems
Problems

Smallest divisor

Smallest divisor

Time limit 1 second
Memory limit 128 MiB

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

Input data

One positive integer n\:(1 < n < 2^{31}).

Output data

Print the smallest divisor of n, other than 1.

Examples

Input example #1
21
Output example #1
3
Author Matviychuk Sergiy Volodymyrovych
Source "ABC programming"