program P2096;
const
  mo=338;
var
  n,u,v,ans1,ans2,i,j,k:longint;
  dist:array[1..100,1..100] of longint;

begin
  assign(input,'hopetree.in');assign(output,'hopetree.out');
  reset(input);rewrite(output);
  readln(n);
  ans1:=0;
  ans2:=233;
  fillchar(dist,sizeof(dist),$3F);
  for i:=1 to n-1 do
  begin
    readln(u,v);
    dist[u,v]:=1;
    dist[v,u]:=1;
  end;
  for k:=1 to n do
    for i:=1 to n do
      for j:=1 to n do
        if dist[i,j]>dist[i,k]+dist[k,j] then dist[i,j]:=dist[i,k]+dist[k,j];
  for i:=1 to n-2 do
    for j:=i+1 to n-1 do
      for k:=j+1 to n do
        if (dist[i,j]=dist[i,k]) and (dist[i,j]=dist[j,k]) then
        begin
          ans1:=(ans1+1) mod mo;
          ans2:=(ans2+1) mod mo;
        end;
  writeln(ans1+1,' ',ans2+1);
  close(input);close(output);
end.