#include<bits/stdc++.h>

using namespace std;

const int N=110;

int n;

vector a[N];

int dep[N],si[N];

int dfs(int x,int f)

{

si[x]=1;

dep[x]=dep[f]+1;

for(int i=0;i<a[x].size();i++)

{

if(a[x][i]!=f) si[x]+=dfs(a[x][i],x);

}

return si[x];

}

int main()

{

int x,y;

cin>>n;

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

{

cin>>x>>y;

a[x].push_back(y);

a[y].push_back(x);

}

dfs(1,0);

for(int i=1;i<=n;i++) cout<< si[i]<< " "<<dep[i]<<endl;

return 0;

}