type mas=array[1..10000000] of integer;
var n,a,b,c:integer;
m:mas;
l,i:integer;

procedure sort(l,r:integer);
var j,t,k,K1,K2,x:integer;
begin
if l<r then begin x:=m[(l+r) div 2];
k1:=0;k2:=0;k:=l;
for j:=l to r do begin
if m[k]>x then begin
t:=m[k];
m[k]:=m[r-k2];
m[r-k2]:=t;
k2:=k2+1;
end else begin
if m[k]<x then begin
t:=m[k];
m[k]:=m[l+k1];
m[l+k1]:=t;
k1:=k1+1;
k:=k+1;
end
 else k:=k+1;
end;
end;
sort(l,l+k1-1);sort(r-k2+1,r);
end; 
end;


begin
assign(input,'task3.in');
reset(input);
assign(output,'task3.out');
rewrite(output);
readln(n);
l:=0;
for a:=1 to n do
for b:=1 to n do
for c:=1 to n do
begin
l:=l+1;
m[l]:=a+b+c;
l:=l+1;
m[l]:=a+b-c;
l:=l+1;
m[l]:=a+b*c;
l:=l+1;
m[l]:=a-b+c;
l:=l+1;
m[l]:=a-b-c;
l:=l+1;
m[l]:=a-b*c;
l:=l+1;
m[l]:=a*b+c;
l:=l+1;
m[l]:=a*b-c;
l:=l+1;
m[l]:=a*b*c;
end;
sort(1,l);
for i:=1 to l-1 do write(m[i],' ');
writeln(m[l]);
close(input);
close(output);

end.