import math


def primes(a):
    # simplest way to calculate :
    A = []
    flag = 0
    A.append(2)
    for i in range(3, a, 2):
        flag = 1
        for j in range(len(A)):
            if i > math.sqrt(i):
                break
            if i % A[j] == 0:
                flag = 0
                break
        if flag:
            A.append(i)
    return A
A = primes(132)
print(A)

922c0710b81d9a2cdc257da8fb66428182fcd7c9
<mask token>


def primes(a):
    A = []
    flag = 0
    A.append(2)
    for i in range(3, a, 2):
        flag = 1
        for j in range(len(A)):
            if i > math.sqrt(i):
                break
            if i % A[j] == 0:
                flag = 0
                break
        if flag:
            A.append(i)
    return A


<mask token>

<mask token>


def primes(a):
    A = []
    flag = 0
    A.append(2)
    for i in range(3, a, 2):
        flag = 1
        for j in range(len(A)):
            if i > math.sqrt(i):
                break
            if i % A[j] == 0:
                flag = 0
                break
        if flag:
            A.append(i)
    return A


<mask token>
print(A)

<mask token>


def primes(a):
    A = []
    flag = 0
    A.append(2)
    for i in range(3, a, 2):
        flag = 1
        for j in range(len(A)):
            if i > math.sqrt(i):
                break
            if i % A[j] == 0:
                flag = 0
                break
        if flag:
            A.append(i)
    return A


A = primes(132)
print(A)

import math


def primes(a):
    A = []
    flag = 0
    A.append(2)
    for i in range(3, a, 2):
        flag = 1
        for j in range(len(A)):
            if i > math.sqrt(i):
                break
            if i % A[j] == 0:
                flag = 0
                break
        if flag:
            A.append(i)
    return A


A = primes(132)
print(A)

import math


def primes(a):
    # simplest way to calculate :
    A = []
    flag = 0
    A.append(2)
    for i in range(3, a, 2):
        flag = 1
        for j in range(len(A)):
            if i > math.sqrt(i):
                break
            if i % A[j] == 0:
                flag = 0
                break
        if flag:
            A.append(i)
    return A
A = primes(132)
print(A)
