def find_primes(n):
    ans = list()
    sieve = [1] * n
    for i in xrange(2, n):
        if sieve[i]:
            ans.append(i)
            for j in xrange(i + i, n, i):
                sieve[j] = 0
    return ans