def find_primes(n):
    n = int(input())
	list_of_primes = []
	k = 0
    for i in range(n+1):
		for j in xrange(0, i):
			if i % j == 0:
            k +=1
	        if k == 0:
        		lst.append(i)
    		else:
        		k = 0
	return list_of_rimes