// print the nth-prime

#include <stdio.h>
#include <stdlib.h>

int is_prime(int number) {
    for (int possible_factor = 2; possible_factor < number; possible_factor++) {
        if (number % possible_factor == 0) {
            return 0;
        }
    }
    return 1;
}

int main(int argc, char *argv[]) {
    int n = atoi(argv[1]);
    int n_primes = 0;
    for (int number = 2; n_primes < n; number++) {
        n_primes += is_prime(number);
        if (n_primes == n) {
            printf("%d\n", number);
            return 0;
        }
    }
}