program bing;
var
 f1,f2:text;
 n,i,j:integer;
 f:array[0..1000] of longint;
begin
 assign(f1,'circlex.in');reset(f1);
 assign(f2,'circlex.out');rewrite(f2);
 readln(f1,n);
 fillchar(f,sizeof(f),0);
 f[0]:=1;f[1]:=1;
 for i:=2 to n do
 begin
 for j:=0 to i-2 do
 f[i]:=(f[i]+f[j]*f[i-2-j])mod 12345;
 f[i]:=(f[i]+f[i-1])mod 12345;
 end;
 writeln(f2,f[n]);
 close(f1);close(f2);
end.