program liste;
type pnod=^nod;
     nod=record
               inf:integer;
               adr:pnod;
               end;
var p,u,nou,q:pnod;
    f,g:text;
    n,i,j:integer;
begin
assign(f,'order.in'); reset(f);
assign(g,'order.out'); rewrite(g);
read(f,n);
new(p); new(u);
p^.inf:=1;
p^.adr:=nil;
u:=p;
for i:=2 to n do begin
         new(nou);
         nou^.inf:=i;
         nou^.adr:=nil;
         u^.adr:=nou;
         u:=nou;
         end;
u^.adr:=p;
q:=p;
q:=p;
for i:=1 to n-1 do begin
   { if i-1<n-i+1 then begin
    for j:=1 to i-1  do  q:=q^.adr;
      nou:=q^.adr;
      q^.adr:=nou^.adr;
      write(g,nou^.inf,' ');
      dispose(nou);
      end
      else begin    }
             for j:=1 to ((i-1)  mod (n-i+1))     do  q:=q^.adr;
      nou:=q^.adr;
      q^.adr:=nou^.adr;
      write(g,nou^.inf,' ');
      dispose(nou);
      {end;}
      end;
write(g,q^.inf);
writeln(g);



close(f); close(g);
end.