def check_prime(n, num=2): prime_list = [] while n != 0: num += 1 prime = True for div in range(2,num): if num % div == 0: prime = False if prime: prime_list.append(num) n -= 1 return prime_list def main(): prime_list = check_prime(int(input())) for i in range(len(prime_list)): print(prime_list[i], end="") if i != len(prime_list)-1: print(end=", ") else: print() if __name__ == '__main__': main()