




def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase)      ->					int:
     return 1 if digit in (0, 1) else (digit * factorial(digit - 1))

def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase)      ->					bool:
     a     =				0
     a     =				number
     while duplicate > 0:
          a  ,				a     =				divmod(__UpperCamelCase		, 10)
          fact_sum += factorial(__UpperCamelCase)
     return fact_sum == number


if __name__ == "__main__":
   print("Program to check whether a number is a Krisnamurthy Number or not.")
   lowercase__				:      str	   = int(input("Enter number: ").strip())
   print(
       F'{number} is {"" if krishnamurthy(number) else "not "}a Krishnamurthy Number.'
   )







import math

def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase)      ->					bool:

     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(__UpperCamelCase) + 1)		, 6):
          if number % i == 0 or number % (i + 2) == 0:
               return False
     return True

def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase = 0.1)      ->					int:
     a     =				3
     a     =				3

     while primes / (2 * j - 1) >= ratio:
          for i in range(j * j + j + 1		, (j + 2) * (j + 2)		, j + 1):
               primes += is_prime(__UpperCamelCase)
          j += 2
     return j


if __name__ == "__main__":
   import doctest

   doctest.testmod()

