program fractiii;
type numar=0..1000000;
var i,j,n,x,c,p: numar;  ok: boolean;
    v:array[1..1000] of 0..9;
procedure aduna;
begin
x:=1;
if v[x]<>9 then inc(v[x]) else
                          while(v[x]=9) do begin
                               v[x]:=0; inc(x); inc(v[x]); end;
end;
function prim(q,w: numar):boolean;
begin
while q<>w do if q>w then dec(q,w) else dec(w,q);
prim:=(q=1);
end;
begin
assign(input,'fractii.in'); reset(input);
read(n);
c:=1;
for i:= 1 to n do
for j:= 1 to n do
if prim(i,j) then aduna;
assign(output,'fractii.out'); rewrite(output); close(input);
ok:=true; p:=1000;
while ok do if v[p]=0 then  dec(p) else ok:=false;
for i:=p downto 1 do write(v[i]);
close(output);
end.