Cod sursa(job #299465)
var n,i:longint;
begin
read(n);
case n mod 4 of
0:begin
writeln('0');writeln(n div 2);
for i:=1 to (n div 4) do write(2*i-1,' ');
for i:=1 to (n div 4) do write((n div 2)+2*i,' ');
writeln;
writeln(n div 2);
for i:=1 to (n div 4) do write(2*i,' ');
for i:=1 to (n div 4) do write((n div 2)+2*i-1);
end;
3:begin
writeln('0');writeln(n div 2);
for i:=1 to (n div 4) do write(2*i,' ');
for i:=1 to (n div 4)+1 do write((n div 2)+2*i,' ');
writeln;
writeln(n div 2+1);
for i:=1 to (n div 4)+1 do write(2*i-1,' ');
for i:=1 to (n div 4)+1 do write((n div 2)+2*i-1,' ');
end;
1:
end;
end.