program aa;
var
a,b,c,d,e,i,j,m,n,max,sum:longint;
f:array[1..10000000]of longint;
f1,f2:text;
begin
assign(f1,'put.in');
assign(f2,'put.out');
reset(f1);
rewrite(f2);
readln(f1,n);
if n=0 then
writeln(f2,'No Solution')
else
begin
f[1]:=0;
f[2]:=1;
for i:=3 to n do
f[i]:=(i-1)*(f[i-1]+f[i-2]) mod 1206;
writeln(f2,f[n]);
end;
close(f1);close(f2);
end.