import sys #input = sys.stdin.readline #文字列につけてはダメ input = sys.stdin.buffer.readline #文字列につけてはダメ #sys.setrecursionlimit(1000000) #import bisect #import itertools #import random #from heapq import heapify, heappop, heappush #from collections import defaultdict #from collections import deque #import copy #import math #from functools import lru_cache #@lru_cache(maxsize=None) #MOD = pow(10,9) + 7 #MOD = 998244353 #dx = [1,0,-1,0] #dy = [0,1,0,-1] def main(): N = int(input()) if N == 5: print("9 12 15 18 21") print("0 3 16 19 37") exit() if N == 8: print("9 12 15 18 21 24 27 30") print("0 3 16 19 22 25 28 43") exit() if N == 11: A = [9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39] B = [0, 3, 16, 19, 22, 25, 28, 31, 34, 37, 49] print(*A) print(*B) exit() if N == 14: A = [9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48] B = [0, 3, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 55] print(*A) print(*B) exit() if N == 17: A = [9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57] B = [0, 3, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 49, 52, 55, 61] print(*A) print(*B) exit() if N%3 == 0: A = [3]; B = [4] for i in range(N-1): if i%3 == 0: A.append(A[-1] + 3) B.append(B[-1] + 3) if i%3 == 1: A.append(A[-1] + 6) B.append(B[-1] + 3) if i%3 == 2: A.append(A[-1] + 3) B.append(B[-1] + 6) elif N%3 == 1: A = [3,6,9,12]; B = [0,7,10,13] for i in range(N-4): if i%3 == 0: A.append(A[-1] + 3) B.append(B[-1] + 3) if i%3 == 1: A.append(A[-1] + 6) B.append(B[-1] + 3) if i%3 == 2: A.append(A[-1] + 3) B.append(B[-1] + 6) else: A = [9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66] B = [0, 3, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 49, 52, 55, 58, 61, 64, 67] for i in range(N-20): if i%3 == 0: A.append(A[-1] + 3) B.append(B[-1] + 3) if i%3 == 1: A.append(A[-1] + 6) B.append(B[-1] + 3) if i%3 == 2: A.append(A[-1] + 3) B.append(B[-1] + 6) #print(sum(A),sum(B)) print(*A) print(*B) if __name__ == '__main__': main()