input: def find_prime_numbers(n: int) -> None:
      """
      This function prints out all prime numbers between 2 and n (inclusive).
      A prime number is only divisible by 1 and itself.
      >>> find_prime_numbers(10)
      2
      3
      5
      7
      >>> find_prime_numbers(20)
      2
      3
      5
      7
      11
      13
      17
      19
      """
      def is_prime(num: int) -> bool:
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      for num in range(2, n + 1):
          if is_prime(num):
              print(num)
output:     def is_prime(num: int) -> bool:
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      for num in range(2, n + 1):
          if is_prime(num):
              print(num)