#include<cstdio>

 #include<algorithm>

 using namespace std;

 const int MAXN=,INF=1e9;

 struct Edge{

     int to,nxt;

 }e[MAXN<<];

 int n,cnt,ans,minn,size=INF;

 int head[MAXN<<],son[MAXN],dep[MAXN];

 bool vis[MAXN];

 void add(int u,int v)

 {

     ++cnt;

     e[cnt].to = v;

     e[cnt].nxt = head[u];

     head[u] = cnt;

 }

 void dfs(int cur)

 {

     vis[cur] = true;

     son[cur] = ;

     int tmp = ;

     for (int i=head[cur]; i; i=e[i].nxt)

     {

         if (!vis[e[i].to])

         {

             dfs(e[i].to);

             son[cur] += son[e[i].to]+;    //加上自己

             tmp = max(tmp,son[e[i].to]+) ;

         }

     }

      tmp = max(tmp,n-son[cur]-);

      if(size>tmp || (tmp==size&&ans>cur))

      {

          ans = cur;

          size = tmp;

      }

 }

 void dfsdep(int x,int p,int d)

 {

     dep[x] = d;

     for (int i=head[x]; i; i=e[i].nxt)

         if(p!=e[i].to)

             dfsdep(e[i].to,x,d+);

 }

 int main()

 {

     scanf("%d",&n);

     for (int x,y,i=; i<n; ++i)

     {

         scanf("%d%d",&x,&y);

         add(x,y);

         add(y,x);

     }

     dfs();

     dfsdep(ans,ans,);

     for (int i=; i<=n; ++i)

     minn += abs(dep[ans]-dep[i]);

         printf("%d %d",ans,minn);

     return ;

 }