def get_primes(n):
if n <= <NUM_LIT:0>:<EOL><INDENT>raise ValueError("<STR_LIT>")<EOL><DEDENT>sieve_size = (n // <NUM_LIT:2> - <NUM_LIT:1>) if n % <NUM_LIT:2> == <NUM_LIT:0> else (n // <NUM_LIT:2>)<EOL>sieve = [True for _ in range(sieve_size)]   <EOL>primes = []      <EOL>if n >= <NUM_LIT:2>:<EOL><INDENT>primes.append(<NUM_LIT:2>)      <EOL><DEDENT>for i in range(sieve_size):<EOL><INDENT>if sieve[i]:<EOL><INDENT>value_at_i = i*<NUM_LIT:2> + <NUM_LIT:3><EOL>primes.append(value_at_i)<EOL>for j in range(i, sieve_size, value_at_i):<EOL><INDENT>sieve[j] = False<EOL><DEDENT><DEDENT><DEDENT>return primes<EOL>
Return list of all primes less than n,
    Using sieve of Eratosthenes.