Lap trinh pascan

Const
arrcon:array[1..12] of integer=(2,3,5,7,11,13,17,19,23,29,31,37);
SL:array[2..9] of longint=(2,2,4,96,1024,2880,81024,770144);
Var
x:array[0..20] of integer;
Prime:array[0..39] of boolean;
Free:array[0..20] of boolean;
n,Result,np:integer;

Procedure Writeresult;
Var
i:integer;
Begin
inc(Result);
For i:=1 to 2*n do Write(x[i],` `);
Writeln;
If Result=10000 then Halt;
End;

Procedure Try(i:integer);
Var
j:integer;
Begin
For j:=1 to 2*n do
IF (Free[j]) and ((Prime[x[i-1]+j])) then
Begin
x[i]:=j;
Free[j]:=false;
IF i=2*n then
Begin
IF prime[x[2*n]+x[1]] then
Begin
WriteResult;
End;
End
else Try(i+1);
Free[j]:=true;
End;
End;

Begin
Readln(n);
Writeln(SL[n]);
For np:=1 to 12 do Prime[arrcon[np]]:=true;
Fillchar(free,sizeof(Free),true);
x[1]:=1;
Free[1]:=false;
try(2);
End.