Taulukot

n = int(input())

def eras(n):
    e = [False, False] + ([True] * (n - 1))
    for i in range(2, n + 1):
        if e[i]:
            for j in range(2 * i, n + 1, i):
                e[j] = False
    return e

seula = eras(2 * n)
tarjolla = set(range(1, n + 1))
toka = []
# x = 1, 2, 3 eli ekan taulukon jarjestys
# toka = [6, 3, ...] eli tokan taulukon järjestys
for x in range(1, n + 1):
    for t in tarjolla:
        summa = x + t
        if seula[summa]:
            toka.append(t)
            tarjolla.remove(t)
            break
    else:
        # vaihdetaan sopivan kanssa toka-taulukosta
        # aiemman pitaa sopia tahan ja tarjolla'sta pitaa loytya sopiva aiempaan
        for i in range(x - 1):
            if not seula[toka[i] + x]:
                continue
            for t in tarjolla:
                if seula[i + 1 + t]:
                    toka.append(toka[i])
                    toka[i] = t
                    tarjolla.remove(t)
                    break
            else:
                continue
            break
print(' '.join(str(x) for x in range(1, n + 1)))
print(' '.join(str(x) for x in toka))

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED