import math

n = 1000
primos = list(range(2, n))

discarded_numbers = []
for (i, value) in enumerate(primos):
  if value > math.sqrt(n):
    break

  if value not in discarded_numbers:
    for j in primos[i:]:
      if j > n/(value):
        break
      discarded_numbers.append(value*j)

print sorted(list(set(primos) - set(discarded_numbers)))