#include <iostream>
#include <vector>
#include <fstream>
using namespace std;

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

vector<vector<int>> dfs(100001);

void DFS(int node, int maxim, int &maximActual, int &finalNode, bool vis[]) {
    vis[node] = true;
    if (dfs[node].size() == 1 && vis[dfs[node][0]] == true) {
        if (maxim > maximActual) {
            finalNode = node;
            maximActual = maxim;
        }
        maxim = 0;
        return;
    }
    for (int i = 0; i < dfs[node].size(); ++i) {
        if (vis[dfs[node][i]] == false) {
            DFS(dfs[node][i], maxim + 1, maximActual, finalNode, vis);
        }
    }
}

int main() {
    int n;
    fin >> n;
    for (int i = 1, x, y; i < n; ++i) {
        fin >> x >> y;
        dfs[x].push_back(y);
        dfs[y].push_back(x);
    }
    int finalMaxim = 0;
    for (int i = 1; i <= n; ++i) {
        bool vis[100001] = {false};
        int maximActual = 0, finalNode;
        DFS(i, 0, maximActual, finalNode, vis);
        finalMaxim = max(maximActual, finalMaxim);
    }
    fout << finalMaxim + 1;
}