program probleArchLord;

const	md =	666013;

var	n: longInt;
	i, x, ans: longInt;

begin
	readln( n );
	
	ans := 0;
	x := (2 * n) mod md;
	for i := 2 * n - 1 downto 1 do
	begin
		x := ( x * int64(i) ) mod md;
		
		ans := ( ans + x ) mod md;
	end;
	
	x := (2 * n) mod md;
	for i := n - 1 downto 0 do
	begin
		x := ( x * int64(i) ) mod md;
		
		ans := ( ans + md - x ) mod md;
	end;
	
	writeln( ans );
end.