n =int(input('Введіть n '))
my_list=[]

def isprime(n):
    '''check if integer n is a prime'''
    # make sure n is a positive integer
    n = abs(int(n))
    # 0 and 1 are not primes
    if n < 2:
        return False
    # 2 is the only even prime number
    if n == 2:
        return True
    # all other even numbers are not primes
    if not n & 1:
        return False
    # range starts with 3 and only needs to go up the squareroot of n
    # for all odd numbers
    for x in range(3, int(n**0.5)+1, 2):
        if n % x == 0:
            return False
    return True

for i in range(n,2*n):
    if isprime(i):
        my_list.append(i)

for i in range (1,len(my_list)):
    if my_list[i]-my_list[i-1] == 2:
        print(my_list[i-1],my_list[i])

for i in range (1,len(my_list)):
    if my_list[i]-my_list[i-1] == 2:
        print(my_list[i-1],my_list[i])

my_list=[]

def is_prime(x):
    return x>=2 and all(x%p!=0 for p in range(2,int(x**.5)+1))

n=int(input())
primes = [x for x in range(n,2*n+1) if is_prime(x)]
twins = [(a,b) for a,b in zip(primes,primes[1:]) if b-a==2]
print(twins)