input: from typing import List
  
  
  def find_prime_numbers(n: int) -> List[int]:
      """Given an integer n, return a list of all prime numbers up to and including n.
      >>> find_prime_numbers(13)
      [2, 3, 5, 7, 11, 13]
      >>> find_prime_numbers(5)
      [2, 3, 5]
      """
      def is_prime(num):
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      primes = []
      for num in range(2, n + 1):
          if is_prime(num):
              primes.append(num)
      return primes
output:     def is_prime(num):
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      primes = []
      for num in range(2, n + 1):
          if is_prime(num):
              primes.append(num)
      return primes