


'''simple docstring'''

def 							SCREAMING_SNAKE_CASE__(		_UpperCamelCase   :					int     ,		_UpperCamelCase   :					int )		->       int:





   '''simple docstring'''







   if a < b:
      return gcd(_UpperCamelCase     ,		_UpperCamelCase )
   if a % b == 0:
      return b
   return gcd(_UpperCamelCase     ,		a % b )



def 							SCREAMING_SNAKE_CASE__(		_UpperCamelCase   :					int     ,		_UpperCamelCase   :					int     ,		_UpperCamelCase   :					int )		->       int:





   '''simple docstring'''







   if y == 0:
      return 1
   UpperCamelCase__			    =    power(_UpperCamelCase     ,		y // 2     ,		_UpperCamelCase ) % mod
   UpperCamelCase__			    =    (temp * temp) % mod
   if y % 2 == 1:
      UpperCamelCase__			    =    (temp * x) % mod
   return temp



def 							SCREAMING_SNAKE_CASE__(		_UpperCamelCase   :					int )		->       bool:





   '''simple docstring'''







   UpperCamelCase__			    =    2
   while b < n:
      if gcd(_UpperCamelCase     ,		_UpperCamelCase ) == 1 and power(_UpperCamelCase     ,		n - 1     ,		_UpperCamelCase ) != 1:
         return False
      b += 1
   return True


if __name__ == "__main__":
       __lowercase:		str    						=  int(input("Enter number: ").strip())
       if is_carmichael_number(number):
              print(F"""{number} is a Carmichael Number.""")
       else:
              print(F"""{number} is not a Carmichael Number.""")






'''simple docstring'''

import math




def  _a     (				lowerCAmelCase_						):





      """simple docstring"""



      if 1 < number < 4:
            # 2 and 3 are primes
            return True
      elif number < 2 or number % 2 == 0 or number % 3 == 0:
            # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
            return False

      # All primes number are in format of 6k +/- 1
      for i in range(5      ,   int(math.sqrt(lowerCAmelCase_						) + 1						)      ,   6						):
            if number % i == 0 or number % (i + 2) == 0:
                  return False
      return True




def  _a     (				lowerCAmelCase_ = 2_000_000						):





      """simple docstring"""



      return sum(num for num in range(3      ,   lowerCAmelCase_      ,   2						) if is_prime(lowerCAmelCase_						)						) + 2 if n > 2 else 0


if __name__ == "__main__":
   print(F"""{solution() = }""")


