/* name: 5651
 * author: 5ab
 * created at: 2023-04-26
 */
#include <iostream>
#include <algorithm>
using namespace std;

typedef long long ll;
const int max_n = 100000;

int hd[max_n], des[max_n * 2], nxt[max_n * 2], par[max_n], cl[max_n], deg[max_n], cdeg[max_n], e_cnt = 0;

void add(int s, int t)
{
	des[e_cnt] = t;
	nxt[e_cnt] = hd[s];
	deg[s]++, deg[t]++;
	hd[s] = e_cnt++;
}

void dfs(int id, int fa)
{
	par[id] = fa;
	for (int p = hd[id], dst; p != -1; p = nxt[p])
	{
		dst = des[p];
		if (dst != fa)
		{
			cl[dst] = cl[id] ^ 1;
			dfs(dst, id);
		}
	}
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n;
	
	cin >> n;
	fill(hd, hd + n, -1);
	for (int i = 1, x, y; i < n; i++)
	{
		cin >> x >> y, x--, y--;
		add(x, y), add(y, x);
	}
	if (n % 2 == 0)
	{
		cout << n << endl;
		return 0;
	}
	
	dfs(n - 1, -1);
	
	int i;
	for (i = n - 1; i >= 0; i--)
	{
		if (deg[i] == 1 || cl[i] != 0)
			break;
		bool ok = true;
		for (int j = i; par[j] != -1 && cdeg[par[j]] <= 1; j = par[j])
		{
			cdeg[j]++, cdeg[par[j]]++;
			if (cdeg[par[j]] > 2 && cl[par[j]] != 1)
			{
				ok = false;
				break;
			}
			// cerr << i << " " << j << " " << par[j] << endl;
		}
		if (!ok)
			break;
	}
	cout << i + 1 << "\n";
	
	return 0;
}
// started coding at: 04-26 19:40:42