a = 20 # С этого числа начнется проверка на деление
s = [] 
for i in range(1, 21):
    s.append(i) 
i = 0 
while 1: 
    if a % s[i] == 0:    
        i += 1
        if i == 20:
            print(a)
            break
        continue
    else:
        a += 1 
        i =0

i = 1
for k in (range(1, 21)):
    if i % k > 0:
        for j in range(1, 21):
            if (i*j) % k == 0:
                i *= j
                break
print(i)

def reshetoEratosfena(n):
    resheto= list(range(2,n))
    for j in range(0,n):
        p=resheto[j]
        if p**2>n:
            break
        i=j+1
        while i<len(resheto):
            if resheto[i]%p==0:
                resheto.remove(resheto[i])
            i=i+1
    return resheto
def getMinProstMnoj(x):
    for p in prost:
        if not x % p:
            return p
    raise ValueError
def getProstmnoj(x):
    out = {}
    while x>1:
        p = getMinProstMnoj(x)
        if p not in out: out[p] = 0
        out[p] += 1
        x = x/p
    return  out
def main(maxx):
    maxstepen = {}
    global prost
    prost = reshetoEratosfena(maxx)
    for x in range(1,maxx):
        out = getProstmnoj(x)
        for p,i in out.items():
            if p not in maxstepen: maxstepen[p] = 0
            maxstepen[p] = max(i, maxstepen[p])
    nop = 1
    for p,i in maxstepen.items():
        nop *= p**i
    print (nop)
if __name__ == '__main__':
    from time import time
    t = time()
    main(10000)
    print(time() - t)

def gcd(a, b):
    """Return greatest common divisor using Euclid's Algorithm."""
    while b:      
        a, b = b, a % b
    return a

def lcm(a, b):
    """Return lowest common multiple."""
    return a * b // gcd(a, b)

def lcmm(*args):
    """Return lcm of args."""   
    return reduce(lcm, args)