def isPrime(n): if n < 2: return False for i in range(2, n): if n % i == 0: return False return True def find(n): pairs = [] for i in range(2, n+1): if isPrime(i-2) and isPrime(i): pairs.append((i-2, i)) return pairs n = int(input()) res = find(n) if len(res) == 0: print('No') else: for pair in res: print(pair[0], pair[1])