input: 
  def find_prime_numbers(n: int) -> None:
      """Find all prime numbers up to a given number n.
      >>> find_prime_numbers(10)
      2
      3
      5
      7
      >>> find_prime_numbers(20)
      2
      3
      5
      7
      11
      13
      17
      19
      """
      
      def is_prime(num):
          # Iterate from 2 to the square root of the number
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
      
      # Iterate from 2 to n
      for num in range(2, n + 1):
          # Check if the number is prime
          if is_prime(num):
              print(num)
  
output:     def is_prime(num):
          # Iterate from 2 to the square root of the number
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
      
      # Iterate from 2 to n
      for num in range(2, n + 1):
          # Check if the number is prime
          if is_prime(num):
              print(num)