program troepfelalgorithmus;
uses wincrt;
var p,q,r,nines,i,j,c,n,z:longint;
    a: array[0..12000] of longint;
procedure umbruch;
   begin c:=c+1;z:=z+1; case c of 10,20,30,40: write(' ');
                           50: begin write('    ');write('(',z,')');writeln;
                                     write('  ');c:=0; end;
                           end;
                        case z of 0: write(','); end;
   end;
procedure eingabe;
   begin writeln('Troepfelalgorithmus');
         writeln('Kreiszahl Pi bis n-te Dezimalstelle');
         write('Gib n ein (n < 3614) : ');readln(n);writeln;
   end;

begin
   p:=-1;nines:=0;c:=-1;z:=-1;eingabe;
   for i:=0 to 12000 do a[i]:=2;
   for j:=-1 to n do begin
      for i:=0 to 12000 do a[i]:=a[i]*10;
      for i:=12000 downto 1 do begin
          q:=a[i] div (2*i+1); r:=a[i] mod (2*i+1); a[i]:=r; a[i-1]:=a[i-1]+i*q;
      end;
      q:=a[0] div 10; a[0]:=a[0] mod 10;
      case q of
         9:                 nines:=nines+1;
         10:                begin p:=p+1; write(p); umbruch;
                            for i:=1 to nines do begin write(0);umbruch; end;
                            P:=0; nines:=0; end;
         0,1,2,3,4,5,6,7,8: begin if p>=0 then begin write(p); umbruch; end;
                            for i:=1 to nines do begin write(9);umbruch;end;
                            P:=q; nines:=0; end;
      end;
   end;
   readln;
end.
