
def a__   (	A_,					A_ ):






  '''simple docstring'''





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

def a__   (	A_,					A_,					A_ ):






  '''simple docstring'''





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

def a__   (	A_ ):






  '''simple docstring'''





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


if __name__ == "__main__":
    __lowerCAmelCase      :					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.''')



import sys

sys.set_int_max_str_digits(0)  # type: ignore

def a__   (	A_ ):






  '''simple docstring'''





  __magic_name__    					=	[0] * 11
  __magic_name__    					=	[0] * 11

  # mark last 9 numbers
  for _ in range(9 ):
    __magic_name__    					=	1
    __magic_name__    					=	number // 10
  # flag
  __magic_name__    					=	True

  # check last 9 numbers for pandigitality

  for x in range(9 ):
    if not check_last[x + 1]:
      __magic_name__    					=	False
  if not f:
    return f

  # mark first 9 numbers
  __magic_name__    					=	int(str(A_ )[:9] )

  for _ in range(9 ):
    __magic_name__    					=	1
    __magic_name__    					=	number // 10

  # check first 9 numbers for pandigitality

  for x in range(9 ):
    if not check_front[x + 1]:
      __magic_name__    					=	False
  return f

def a__   (	A_ ):






  '''simple docstring'''





  __magic_name__    					=	[0] * 11

  # mark last 9 numbers
  for _ in range(9 ):
    __magic_name__    					=	1
    __magic_name__    					=	number // 10
  # flag
  __magic_name__    					=	True

  # check last 9 numbers for pandigitality

  for x in range(9 ):
    if not check_last[x + 1]:
      __magic_name__    					=	False
  return f

def a__   (	):






  '''simple docstring'''





  __magic_name__    					=	1
  __magic_name__    					=	1
  __magic_name__    					=	2
  # temporary Fibonacci numbers

  __magic_name__    					=	1
  __magic_name__    					=	1
  __magic_name__    					=	2
  # temporary Fibonacci numbers mod 1e9

  # mod m=1e9, done for fast optimisation
  __magic_name__    					=	[0] * 1000000
  __magic_name__    					=	1000000000

  for x in range(1000000 ):
    __magic_name__    					=	(aa + ba) % m
    __magic_name__    					=	ba % m
    __magic_name__    					=	ca % m
    if checka(A_ ):
      __magic_name__    					=	1

  for x in range(1000000 ):
    __magic_name__    					=	a + b
    __magic_name__    					=	b
    __magic_name__    					=	c
    # perform check only if in tocheck
    if tocheck[x + 3] and check(A_ ):
      return x + 3  # first 2 already done
  return -1


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

