program circlex;
var
i,j,m,n:longint;
f:array[0..1000] of longint;
begin
assign(input,'circlex.in');reset(input);
assign(output,'circlex.out');rewrite(output);
readln(n);
f[1]:=1; f[2]:=2; f[3]:=4; f[0]:=1;
for i:=3 to n do
 begin
 f[i]:=f[i-1];
  for j:=1 to i-1 do
  begin
  f[i]:=(f[i]+f[j-1]*f[i-1-j])mod 12345;
  end;
  end;
writeln(f[n] mod 12345);
close(output);
end.