import numpy as np
import random


def factors(n):
    return [i for i in range(1, n // 2 + 1) if not n % i] + [n]


a = 11

value1 = np.round((1024 / 23) * random.randint(1, 32))
value2 = np.round((1024 / 23) * random.randint(1, 32))
value3 = np.round((1024 / 23) * random.randint(1, 32))

array1 = np.arange(value1 - a, value1 + 1 + a, 1)
array2 = np.arange(value2 - a, value2 + 1 + a, 1)
array3 = np.arange(value3 - a, value3 + 1 + a, 1)

gcds = []

for i in array1:
    for j in array2:
        gcds.extend(factors(np.gcd(int(i), int(j))))
    for k in array3:
        gcds.extend(factors(np.gcd(int(i), int(k))))
for l in array2:
    for m in array3:
        gcds.extend(factors(np.gcd(int(l), int(m))))

prev_list = list(set(gcds))

for z in range(500):
    value1 = np.round((1024/23)*random.randint(1, 32))
    value2 = np.round((1024/23)*random.randint(1, 32))
    value3 = np.round((1024/23)*random.randint(1, 32))

    array1 = np.arange(value1-a, value1+1+a, 1)
    array2 = np.arange(value2-a, value2+1+a, 1)
    array3 = np.arange(value3-a, value3+1+a, 1)

    gcds = []

    for i in array1:
        for j in array2:
            gcds.extend(factors(np.gcd(int(i), int(j))))
        for k in array3:
            gcds.extend(factors(np.gcd(int(i), int(k))))
    for l in array2:
        for m in array3:
            gcds.extend(factors(np.gcd(int(l), int(m))))

    common = list(set(prev_list).intersection(list(set(gcds))))
    print(common)
    prev_list = common