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

class Task {
public:
    void solve() {
        read_input();
        print_output();
    }

private:
    // numarul maxim de noduri
    static constexpr int NMAX = (int)1e5 + 5; // 10^5 + 5 = 100.005

    int n;
    vector<int> adj[NMAX];
    int vizitat[NMAX];
    int nivelMax, pozitie;

    void read_input() {
        ifstream fin("darb.in");
        fin >> n;
        for (int i = 1, x, y; i < n; i++) {
            fin >> x >> y;
            adj[x].push_back(y);
            adj[y].push_back(x);
        }
        fin.close();
    }


    void DFS_RECURSIVE(int node, int niv) {
        vizitat[node] = 1;
        if (niv > nivelMax) {
            nivelMax = niv;
            pozitie = node;
        }
        for (auto neigh : adj[node]) {
            if (vizitat[neigh] == 0) {
                vizitat[neigh] = 1;
                DFS_RECURSIVE(neigh, niv + 1);
                
            }
        }
    }
    int get_result() {
        vector<int> p(n + 1);
        int nr = 0;
        for (int i = 1; i <= n; i++) {
            p[i] = 0;
        }
        DFS_RECURSIVE(1, 0);
        for (int i = 1; i <= n; i++) {
            vizitat[i] = 0;
        }
        DFS_RECURSIVE(pozitie, 0);
        
    return nivelMax + 1;
    }

    void print_output() {
        ofstream fout("darb.out");
        fout << get_result() << '\n';
        fout.close();
    }
};

int main() {
    auto* task = new (nothrow) Task();
    if (!task) {
        cerr << "new failed: WTF are you doing? Throw your PC!\n";
        return -1;
    }
    task->solve();
    delete task;
    return 0;
}