#include<fstream>
#include<queue>
#include<vector>
using namespace std;
ifstream fin("darb.in");
ofstream fout("darb.out");
vector <int> v[100001];
queue <int> q;
int last, n, i, j, a, b, cost[100001];

void bfs(int st){
    for (i = 1; i <= n; i++)
        cost[i] = -1;
    cost[st] = 1;
    q.push(st);
    while (!q.empty()){
        int nod = q.front(); q.pop();
        for (i = 0; i < v[nod].size(); i++)
            if (cost[v[nod][i]] == -1){
                cost[v[nod][i]] = cost[nod] + 1;
                last = v[nod][i];
                q.push(v[nod][i]);
            }
    }
}

int main(){
    fin >> n;
    for (i = 1; i <= n - 1; i++){
        fin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    bfs(1);
    bfs(last);
    fout << cost[last] << '\n';
    fin.close();
    fout.close();
}