#include <fstream>
#include <vector>
#include <deque>
#include <cstring>

using namespace std;

fstream fin("darb.in");
ofstream fout("darb.out");

int viz[100001], mlc, n, x, dist[100001], a, b, i, node, maxx, temp;
vector <int> gr[100001];
deque<int> q;

void bfs(int node)
{
    viz[node] = 1;
    q.push_back(node);
    while (!q.empty())
    {
        x = q.front();
        for (auto it : gr[x])
            if (!viz[it])
            {
                viz[it] = 1;
                dist[it] = dist[x] + 1;
                q.push_back(it);
            }
        q.pop_front();
    }
}

int main()
{
    fin >> n;
    for (i = 1; i <= n - 1; i++)
    {
        fin >> a >> b;
        gr[a].push_back(b);
        gr[b].push_back(a);
    }

    node = 1;
    viz[node] = 1;
    q.push_back(node);
    while (!q.empty())
    {
        mlc++;
        x = q.front();
        for (auto it : gr[x])
            if (!viz[it])
            {
                viz[it] = 1;
                dist[it] = dist[x] + 1;
                q.push_back(it);
            }
        q.pop_front();
    }

    if (mlc == n + 1) while (1);

    return 0;
}