input: def find_primes_up_to(n: int) -> None:
      """ Given an integer n, find all prime numbers up to and including n.
      A prime number is a number greater than 1 that has no divisors other than 1 and itself.
      This function prints each prime number found.
      >>> find_primes_up_to(10)
      2
      3
      5
      7
      """
      def is_prime(num: int) -> bool:
          if num < 2:
              return False
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      for number in range(2, n + 1):
          if is_prime(number):
              print(number)
output:     for number in range(2, n + 1):
          if is_prime(number):
              print(number)