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