taak5oef7

def get_prime(n):
    number = 1
    counter = 0
    prime_list = []
    factorial = 1

    while counter != n:
        factorial *= (number-1)

        for i in prime_list:
            if number % i == 0:
                number += 1
        if number < 1 or factorial % number != number - 1:
            number += 1
        elif number >= 1 and factorial % number == number - 1:
            number += 1
            counter += 1
            prime_list = prime_list.append(number)

        return number

if __name__ == '__main__':
    print(get_prime(100))