


'''simple docstring'''







from __future__ import annotations

a__  : int				=	[2, 1, 4, 5, 6, 0, 8, 9, 1, 2, 0, 6, 4, 2, 0, 6, 5, 3, 2, 7]
class  lowercase_					:


    def __init__(					self  , a   ):
          UpperCamelCase__  =    -1
          UpperCamelCase__  =    -1
          UpperCamelCase__  =    [-1] * length
          UpperCamelCase__  =    None
          UpperCamelCase__  =    None


    def __repr__(					self   ):
          return f'''Node(min_value={self.minn} max_value={self.maxx})'''







def _UpperCamelCase	(					__A   )							->		Node | None:


      '''simple docstring'''



      UpperCamelCase__  =    Node(len(__A   )   )
      UpperCamelCase__ ,     UpperCamelCase__  =    min(__A   ), max(__A   )
      # Leaf node case where the node contains only one unique value
      if root.minn == root.maxx:
            return root
      UpperCamelCase__  =    (root.minn + root.maxx) // 2

      UpperCamelCase__  =    []
      UpperCamelCase__  =    []

      for index, num in enumerate(__A   ):
            if num <= pivot:
                  left_arr.append(__A   )
            else:
                  right_arr.append(__A   )
            UpperCamelCase__  =    len(__A   )
      UpperCamelCase__  =    build_tree(__A   )
      UpperCamelCase__  =    build_tree(__A   )
      return root







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


      '''simple docstring'''



      if index < 0 or node is None:
            return 0
      # Leaf node cases
      if node.minn == node.maxx:
            return index + 1 if node.minn == num else 0
      UpperCamelCase__  =    (node.minn + node.maxx) // 2
      if num <= pivot:
            # go the left subtree and map index to the left subtree
            return rank_till_index(node.left				,      __A				,      node.map_left[index] - 1   )
      else:
            # go to the right subtree and map index to the right subtree
            return rank_till_index(node.right				,      __A				,      index - node.map_left[index]   )







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


      '''simple docstring'''



      if start > end:
            return 0
      UpperCamelCase__  =    rank_till_index(__A				,      __A				,      __A   )
      UpperCamelCase__  =    rank_till_index(__A				,      __A				,      start - 1   )
      return rank_till_end - rank_before_start







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


      '''simple docstring'''



      if index > (end - start) or start > end or node is None:
            return -1
      # Leaf node case
      if node.minn == node.maxx:
            return node.minn
      # Number of elements in the left subtree in interval [start, end]
      UpperCamelCase__  =    node.map_left[end] - (
          node.map_left[start - 1] if start else 0
      )
      if num_elements_in_left_tree > index:
            return quantile(
                node.left				,      __A				,      (node.map_left[start - 1] if start else 0)				,      node.map_left[end] - 1				,      )
      else:
            return quantile(
                node.right				,      index - num_elements_in_left_tree				,      start - (node.map_left[start - 1] if start else 0)				,      end - node.map_left[end]				,      )







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


      '''simple docstring'''



      if (
          start > end
          or node is None
          or start_num > end_num
          or node.minn > end_num
          or node.maxx < start_num
      ):
            return 0
      if start_num <= node.minn and node.maxx <= end_num:
            return end - start + 1
      UpperCamelCase__  =    range_counting(
          node.left				,      (node.map_left[start - 1] if start else 0)				,      node.map_left[end] - 1				,      __A				,      __A				,      )
      UpperCamelCase__  =    range_counting(
          node.right				,      start - (node.map_left[start - 1] if start else 0)				,      end - node.map_left[end]				,      __A				,      __A				,      )
      return left + right


if __name__ == "__main__":
  import doctest

  doctest.testmod()









'''simple docstring'''







def _UpperCamelCase	(					__A   )							->		int:


      '''simple docstring'''



      if number != int(__A   ):
            raise ValueError("factorial() only accepts integral values"   )
      if number < 0:
            raise ValueError("factorial() not defined for negative values"   )
      UpperCamelCase__  =    1
      for i in range(1				,      number + 1   ):
            value *= i
      return value







def _UpperCamelCase	(					__A   )							->		int:


      '''simple docstring'''



      if not isinstance(__A				,      __A   ):
            raise ValueError("factorial() only accepts integral values"   )
      if n < 0:
            raise ValueError("factorial() not defined for negative values"   )
      return 1 if n == 0 or n == 1 else n * factorial(n - 1   )


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  a__  : str				=	int(input('Enter a positive integer: ').strip() or 0)
  print(F"""factorial{n} is {factorial(n)}""")





