input: def find_primes(n: int) -> None:
      """Generates all prime numbers up to the given number n.
      >>> find_primes(10)
      2
      3
      5
      7
      """
      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)