Farthest Co-Prime within (2, 250)

def common(arr1, arr2):
    T3 = ()

    for i in arr1:
        for j in arr2:
            if i == j:
                T3 += (i,)

    return T3

def factors(n):
    T1 = (1,)

    for i in range(2,n+1):
        if n%i == 0:
            T1 += (i,)

    return T1

def allCP(arr):
    D1 = dict()
    res = ()

    for i in arr:
        factor_i = factors(i)
        for j in range(2,251):
            factor_j = factors(j)
            common_f = common(factor_i, factor_j)

            if (len(common_f) == 1) and (1 in common_f):
                res += (j,)
        else:
            D1[i] = res
            res = ()

    return D1

def farthestCP(arr):
    D1 = allCP(arr)
    val = [i for i in range(2,251)]
    middle = len(val)//2
    final = []

    for i in D1:
        if i <= val[middle]:
            farCP = max(D1[i])
            final.append(farCP)
        else:
            farCP = min(D1[i])
            final.append(farCP)

    print(final)

farthestCP([60,246,75,103,155,110])