program preprocesare_fractii;
const prim:array[1..168] of integer=(2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,
      53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,
      157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,
      257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,
      379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,
      491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,
      613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,
      739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,
      859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997);
var  fo:text;
     s,aux,nr,rez,k:int64;
     i,j:longint;
     v:array[1..168] of longint;

procedure calcul(n,s:int64;var rez:int64); {bun verificat!}
var nim,num:int64; i:longint;
begin
  num:=1;nim:=1;
  for i:=1 to nr do
      begin
        num:=num*(v[i]-1);
        nim:=nim*v[i];
      end;
  rez:=s+((n*num) div nim);
end;

begin
  assign(fo,'fractii.out');
  rewrite(fo);
  s:=1;
  for i:=2 to 1000000 do
      begin
        {de aici pana (vezi mai jos)}
        for j:=1 to nr do v[j]:=0;
        aux:=i;
        nr:=0;
        j:=0;
        repeat
          inc(j);
          if j>168 then
             begin
               inc(nr);
               v[nr]:=aux;
               aux:=1;
             end
          else
          if aux mod prim[j]=0 then
             begin
               inc(nr);
               v[nr]:=prim[j];
               repeat
                 aux:=aux div prim[j];
               until aux mod prim[j]<>0;
             end;
        until aux=1;
        {pana aici descompune numarul i in factori,rezultatu e vectoru v cu nr elemente}
        calcul(i,s,rez);   {calculeaza numaru lu euclid pt i}
        s:=rez;
        if i mod 1000 = 0 then
           begin
             inc(k);
             if k mod 10=0 then writeln(fo);
             write(fo,2*rez-1,',');
          end;

      end;
  writeln(fo);
  writeln(fo,k);
  close(fo);
end.