Least divisor

Explanation of the Code

1. Reading Input:
   n = int(input())

   • The input() function reads a line of text from the user.
   • The int() function converts this input to an integer and stores it in the variable n.
2. Finding the Smallest Divisor:

   divisor = 2

   while n % divisor != 0:

   divisor += 1

   • Initialize divisor to 2.
   • Use a while loop to check if n is divisible by divisor (i.e., n % divisor == 0).
   • If n is not divisible by divisor, increment divisor by 1 and repeat the check.