import sys
input = lambda : sys.stdin.readline().rstrip()

write = lambda x: sys.stdout.write(x+"\n"); writef = lambda x: print("{:.12f}".format(x))
debug = lambda x: sys.stderr.write(x+"\n")
YES="Yes"; NO="No"; pans = lambda v: print(YES if v else NO)
LI = lambda : list(map(int, input().split()))
sys.setrecursionlimit(3*10**5+10)

n = int(input())
def main(n):
    if n%3==0:
        a = list(range(0,3*n,3))
        b = list(range(1,3*n+1,3))
        d = n//3
        for i in range(n-d,n):
            a[i] += 3
    elif n%3==1:
        a = list(range(0,3*n,3))
        b = list(range(1,3*n+1,3))
        d = n//3
        for i in range(n-d,n):
            a[i] += 3
        a[-1] += 1
    else:
        a = list(range(1,3*n+1,3))
        b = list(range(2,3*n+2,3))
        v = 30
        a = [v+vv for vv in a]
        b = [v+vv for vv in b]
        d = (n)//3
        for i in range(n-d,n):
            a[i] += 3
        a[-1] += 1
        a[-2] += 1
        a[-1] += 15
        a[-2] += 15
        a[0] -= 15
        a[1] -= 15
#     print(a,b)
    assert sum(a)==sum(b), (a,b)
    for i in range(n-1):
        assert a[i]<a[i+1] and b[i]<b[i+1]
    assert len(set(a+b))==2*n
    sa = set()
    sb = set()
    for i in range(n):
        for j in range(n):
            sa.add(a[i]+a[j])
            sb.add(b[i]+b[j])
    assert len(sa&sb)==0
    return a,b
a,b = main(n)
print(*a)
print(*b)