input: Write a python function to get the nth prime number.
  assert get_nth_prime(1) == 2
  assert get_nth_prime(5) == 11
  assert get_nth_prime(10) == 29
output: def get_nth_prime(n):
      def is_prime(num):
          if num <= 1:
              return False
          for i in range(2, int(num**0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      count = 0
      num = 1
      while count < n:
          num += 1
          if is_prime(num):
              count += 1
      return num