import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = -1-(-1 << 31)
# inf = -1-(-1 << 62)

# md = 10**9+7
# md = 998244353

n=II()
aa=list(range(6,6+n*3,3))

p=n%3
bb=[0,3][:p]+list(range(1,1+(n-p)*3,3))
d=sum(aa)-sum(bb)
c,d=divmod(d,(n-2)*3)
for i in range(2,n):bb[i]+=c*3
i=n-1
while d:
    bb[i]+=3
    d-=3
    i-=1

bb.sort()
print(*aa)
print(*bb)