




def 					SCREAMING_SNAKE_CASE	(       __UpperCamelCase			:						int       ,     __UpperCamelCase			:						int      )  ->							int:
    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:
    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:
    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__":
 _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.")











'''simple docstring'''







from functools import lru_cache






@lru_cache
def 		_lowercase		(	lowercase_  ):



		'''simple docstring'''







		if not isinstance(lowercase_						,							lowercase_  ):
				raise TypeError("k must be an integer."  )
		if k < 0:
				raise ValueError("k integer must be greater or equal to zero."  )
		if k == 0:
				return 0
		elif k == 1:
				return 1
		else:
				return fibonacci(k - 1  ) + fibonacci(k - 2  )






def 		_lowercase		(	lowercase_						,							lowercase_  ):



		'''simple docstring'''







		_snake_case	       =       len(lowercase_  )
		# Find m such that F_m >= n where F_i is the i_th fibonacci number.
		_snake_case	       =       0
		while True:
				if fibonacci(lowercase_  ) >= len_list:
						_snake_case	       =       i
						break
				i += 1
		_snake_case	       =       0
		while fibb_k > 0:
				_snake_case	       =       min(
				    offset + fibonacci(fibb_k - 1  )						,							len_list - 1  )  # Prevent out of range
				_snake_case	       =       arr[index_k]
				if item_k_1 == val:
						return index_k
				elif val < item_k_1:
						fibb_k -= 1
				elif val > item_k_1:
						offset += fibonacci(fibb_k - 1  )
						fibb_k -= 2
		else:
				return -1


if __name__ == "__main__":
						import doctest

						doctest.testmod()





