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

ifstream fin("darb.in");
ofstream fout("darb.out");
vector <int> edgesList[100001];
int maxx;

void dfs(int current, int sum) {
    for (int i = 0; i < edgesList[current].size(); i++)
        dfs(edgesList[current][i], sum + 1);
    maxx = max(maxx, sum);
}

int main() {
    int numOfVertices, v, w;

    fin >> numOfVertices;
    for (int i = 1; i < numOfVertices; i++) {
        fin >> v >> w;
        edgesList[v].push_back(w);
    }

    vector <int> distance(numOfVertices + 1);
    for (int i = 0; i < edgesList[1].size(); i++) {
        int current = 1;
        dfs(edgesList[1][i], current);

        distance.push_back(maxx);
        maxx = 0;
    }

    sort(distance.begin(), distance.end(), greater <int>());
    fout << distance[0] + distance[1] + 1;

    return 0;
}