n = int(input())
b = [1, 0] * (n + 1)
#1 - составное, 0 - простое
y = len(b)
countermax = 0

def f():
    for i in range(3, round(float(2*n)**0.5) + 1, 2):
        if b[i] == 0:
            for j in range(2*i, y, i):
                b[j] = 1

f()
counter = 1
for i in range(n + 1, 2*n):
    if b[i] == 1 and b[i + 1] == 1:
        counter = counter + 1
    else:
        counter = 1
    if counter > countermax:
        countermax = counter
        r = i
        l = r - counter + 1

print(l + 1, r + 1)