25 маска 2 * и проверка на простоту

#https://kpolyakov.spb.ru/school/ege/gen.php?action=viewVar&answers=on&varId=13

def is_prime(x):
    for i in range(2, x):
        if x % i == 0:
            return False
    return True


answ = []
for k1 in range(4):
    for x in range(10**k1):
        for z in range(10):
            for k2 in range(4 - k1):
                for y in range(10 ** k2):
                    X = str(x)
                    X = '0' * (k1 - len(X)) + X
                    if k1 == 0:
                        X = ''
                    Y = str(y)
                    Y = '0' * (k2 - len(Y)) + Y
                    if k2 == 0:
                        Y = ''
                    n = int('7' + X + '53' + str(z) + '3' + Y + '1')
                    sm = 7 + 5 + 3 + z + 3 + 1 + sum(map(int, X + Y))
                    if n % 2627 == 0 and is_prime(sm):
                        answ.append(n)
answ.sort()
for e in answ:
    print(e, e // 2627)