program treeb;
var
  n,i,j,a,m,max,ans,r:longint;
  sz:array[1..100,0..100]of longint;
  hx:array[1..1000]of boolean;
procedure find(a,c:longint);
var
  i:longint;
begin
  if sz[a,0]=0 then begin
    if c>max then begin
      max:=c;
      ans:=1;
    end
    else begin
      if c=max then ans:=ans+1;
    end;
  end
  else begin
    for i:=1 to sz[a,0] do
      find(sz[a,i],c+1);
  end;
end;
begin
  assign(input,'treeb.in');
  assign(output,'treeb.out');
  reset(input);
  rewrite(output);
  readln(n);
  fillchar(hx,sizeof(hx),true);
  for i:=1 to n do
  begin
    read(a);
    read(m);
    sz[a,0]:=m;
    for j:=1 to m do
    begin
      read(sz[a,j]);
      hx[sz[i,j]]:=false;
    end;
    readln;
  end;
  max:=0;
  ans:=0;
  for i:=1 to n do
    if hx[i] then begin
      r:=i;
      break;
    end;
  find(r,1);
  writeln(max);
  writeln(ans);
  close(input);
  close(output);
end.