Taulukot

n = int(input())
a, b, c = [x for x in range(n, 0, -1)], [x for x in range(1, n+1)], []
primes = [x for x in range(2, 2 * n+1) if all(x % i != 0 for i in range(2, int(x ** 0.5)))]

for k in a:
    for i in range(n):
        if k+b[i] in primes:
            c.append(b.pop(i))
            break

print(*a)
print(*c)

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: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 8, in <module>
    if k+b[i] in primes:
IndexError: list index out of range

Test 6

Group: 2

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 8, in <module>
    if k+b[i] in primes:
IndexError: list index out of range

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 8, in <module>
    if k+b[i] in primes:
IndexError: list index out of range

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