Как подобрать числа для пар, чтобы получилось максимально возможное количество ?

def prnum(n) :
    prime = [True] * (n+1)
    prime[0] = prime[1] = False
    prime[2] = True
    for j in range(4, n+1, 2):
        prime[j] = False
    for i in range(3, n + 1, 2) :
        if not prime[i]:
            continue
        for j in range(i * i, n+1, i):
            prime[j] = False
        i += 2
    return prime
 
n = int(input())
prime = prnum(2 * n)
for i in range(1, n) :
    for j in range(i + 1, n + 1) :
        if prime[i + j] :
            print(i, j)

def isprime(n):
    d = 2
    while d * d <= n and n % d != 0:
        d += 1
    return d * d > n
 
n = 8
waste = []
lst = list(range(1, n+1))
for i_1, one  in enumerate(lst):
    for i_2, two in enumerate(lst):
        if isprime(one + two) and ((one not in waste) and (two not in waste)):
            print(one, two)
            waste.append(one)
            waste.append(two)

def prnum(n) :
    prime = [True] * (n+1)
    prime[0] = prime[1] = False
    prime[2] = True
    for j in range(4, n+1, 2):
        prime[j] = False
    for i in range(3, n + 1, 2) :
        if not prime[i]:
            continue
        for j in range(i * i, n+1, i):
            prime[j] = False
        i += 2
    return prime
 
n = int(input())
prime = prnum(2 * n)
num = [[i, i + 1] for i in range(1, n, 2)]
for i in range(n//2) :
    if not prime[num[i][0] + num[i][1]] :
        for j in range(i) :
            k1 = num[j][1] + num[i][0]
            k2 = num[j][0] + num[i][1]
            if prime[k1] and prime[k2] :
                num[j][1], num[i][1] = num[i][1], num[j][1]
                break
#print(num)
for i in num :
    print(*i, ' ', prime[i[1] + i[0]])