var     n,i,j: longint;
        a:array[0..10000] of longint;
procedure nhap;
begin
        readln(n);
        for i:=1 to n do
        read(a[i]);
end;
procedure sort(l,r: longint);
      var
         i,j,x,y: longint;
      begin
         i:=l;
         j:=r;
         x:=a[(l+r) div 2];
         repeat
           while a[i]<x do
            inc(i);
           while x<a[j] do
            dec(j);
           if not(i>j) then
             begin
                y:=a[i];
                a[i]:=a[j];
                a[j]:=y;
                inc(i);
                j:=j-1;
             end;
         until i>j;
         if l<j then
           sort(l,j);
         if i<r then
           sort(i,r);
      end;
procedure xuli;
var     khac,giong,d: longint;
begin
        khac:=0; giong:=0;
        for i:=1 to n do
        begin
                if (a[i+1]-a[i]>=400) and (a[i+1]<>3200) and (a[i]<>a[i+1]) then inc(khaC);

        end;
        d:=0;
        for i:=1 to n do
        begin
                if a[i]=3200 then inc(D);

        end;
        if (d>0) and (khac<>0) then writeln(khac+1,' ',khac+1+d);
        if (d=0) and (khac<>0) then writeln(khac+1,' ',n-khac-1);
        if (khac=0) then writeln(1,' ',1);
end;
 begin
       
        nhap;
        sort(1,n);
        xuli;
    
 end.

