#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

const int LOG = 17;
const int N = 1 << LOG;

struct Graph
{
	int t = 0;
	int tin[N], tout[N];
	VI g[N];
	
	void addEdge(int a, int b)
	{
		g[a].PB(b);
		g[b].PB(a);
	}
	int up[LOG][N];
	void dfs1(int v, int p)
	{
		up[0][v] = p;
		FOR(i, 0, LOG - 1)
			up[i + 1][v] = up[i][up[i][v]];
		
		tin[v] = t++;
		for(int to : g[v])
			if(to != p)
				dfs1(to, v);
		tout[v] = t++;
	}
	bool isParent(int v, int p)
	{
		return tin[p] <= tin[v] && tout[v] <= tout[p];
	}
	int lca(int u, int v)
	{
		if(isParent(u, v))
			return v;
		
		RFOR(i, LOG, 0)
			if(!isParent(u, up[i][v]))
				v = up[i][v];
		return up[0][v];	
	}
	
	
	int upVal[N];
	int ans2 = 0;
	int ans3 = 0;
	
	void dfs2(int v, int p)
	{
		for(int to : g[v])
		{
			if(to == p)
				continue;
			dfs2(to, v);
			
			if(upVal[to] == 1)
				ans2++;
			if(upVal[to] == 2)
				ans3++;
			
			upVal[v] += upVal[to];	
		}
	}
}G[2];


int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	
	int n;
	cin >> n;
	
	FOR(t, 0, 2)
	{
		FOR(i, 0, n - 1)
		{
			int a, b;
			cin >> a >> b;
			G[t].addEdge(a - 1, b - 1);
		}
	}
	
	int ans2 = 0, ans3 = 0;
	
	FOR(t, 0, 2)
	{
		G[t].dfs1(0, 0);
		
		FOR(a, 0, n)
		{
			for(int b : G[t ^ 1].g[a])
			{
				if(a > b)
					continue;
				int c = G[t].lca(a, b);
				G[t].upVal[a]++;
				G[t].upVal[b]++;
				G[t].upVal[c] -= 2;
				
				
			}
		}
		G[t].dfs2(0, 0);
		ans2 += G[t].ans2;
		ans3 += G[t].ans3;
	}
	if(ans2 != 0)
		cout << "2 " << ans2 / 2 << "\n";
	else
		cout << "3 " << ans3 << "\n";
	
	
	
	
	
	
	
	


	
	
	return 0;
}