import math

def getAllPrimes(maxn):
  allPrimes = []
  for n in range(3, maxn+1):
    if n % 2 == 0:
        continue

    for i in range(3, 1 + int(math.sqrt(n)), 2):
        if n % i == 0:
            break
    else:
        allPrimes.append(n)

  return allPrimes

print(getAllPrimes(100))
print(getAllPrimes(50))