算法模板——线性欧拉函数

var
   i,j,k,l,m,n:longint;
   a,b:array[0..10000005] of longint;
procedure phi;
          var i,j:longint;
          begin
               m:=0;a[1]:=1;
               for i:=2 to n do
                   begin
                        if a[i]=0 then
                           begin
                                inc(m);
                                b[m]:=i;
                                a[i]:=i-1;
                           end;
                        for j:=1 to m do
                            begin
                                 if (i*b[j])>n then break;
                                 if (i mod b[j])=0 then
                                    a[i*b[j]]:=a[i]*b[j]
                                 else
                                     a[i*b[j]]:=a[i]*(b[j]-1);
                            end
                   end;
          end;
begin
     readln(n);phi;
     while true do
           begin
                readln(j);
                writeln(a[j]);
           end;
end.