
def    _a (						lowerCamelCase,     lowerCamelCase							):
 if a < b:
  return gcd(lowerCamelCase,     lowerCamelCase							)
 if a % b == 0:
  return b
 return gcd(lowerCamelCase,     a % b							)





def    _a (						lowerCamelCase,     lowerCamelCase,     lowerCamelCase							):
 if y == 0:
  return 1
 lowerCamelCase		:     Union[str, Any]          =				power(lowerCamelCase,     y // 2,     lowerCamelCase							) % mod
 lowerCamelCase		:     str          =				(temp * temp) % mod
 if y % 2 == 1:
  lowerCamelCase		:     Optional[Any]          =				(temp * x) % mod
 return temp





def    _a (						lowerCamelCase							):
 lowerCamelCase		:     str          =				2
 while b < n:
  if gcd(lowerCamelCase,     lowerCamelCase							) == 1 and power(lowerCamelCase,     n - 1,     lowerCamelCase							) != 1:
   return False
  b += 1
 return True


if __name__ == "__main__":
      _lowerCamelCase        =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





def    _a (						lowerCamelCase,     lowerCamelCase							):
 if not numbers:
  return 0
 if target == 0 and target in numbers:
  return 0
 if not isinstance(lowerCamelCase,     (list, tuple)							) or not all(
     isinstance(lowerCamelCase,     lowerCamelCase							) for number in numbers							):
  raise ValueError("""numbers must be an iterable of integers"""							)

 lowerCamelCase		:     str          =				0
 lowerCamelCase		:     List[str]          =				sys.maxsize

 while right < len(lowerCamelCase							):
  curr_sum += numbers[right]
  while curr_sum >= target and left <= right:
   lowerCamelCase		:     Any          =				min(lowerCamelCase,     right - left + 1							)
   curr_sum -= numbers[left]
   left += 1
  right += 1

 return 0 if min_len == sys.maxsize else min_len




