#include<bits/stdc++.h>
using namespace std;
#define in f
#define out g

ifstream f ("darb.in");
ofstream g ("darb.out");

queue <int> q;
vector <int> v[1000010];
int n;
int depth[1000010];
int s;
int viz[100010];
int node;
int m;
int x;
int y;
int aux;
int aux1;
int rez;

int main() {

    in >> n;
    for(int i = 1; i < n; i++) {
        in >> x;
        in >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    q.push(1);
    viz[1] = 1;
    while(q.empty() == false) {
        node = q.front();
        q.pop();
        for(int i = 0; i < v[node].size(); i++) {
            if(viz[v[node][i]] == 0) {
                q.push(v[node][i]);
                depth[v[node][i]] = depth[node] + 1;
                viz[v[node][i]]++;
            }
        }
    }
    for(int i = 1; i <= n; i++) {
        if(depth[i] > aux) {
            aux1 = i;
        }
        aux = max(aux, depth[i]);
        viz[i] = 0;
        depth[i] = 0;
    }

    q.push(aux1);
    viz[aux1] = 1;
    while(q.empty() == false) {
        node = q.front();
        q.pop();
        for(int i = 0; i < v[node].size(); i++) {
            if(viz[v[node][i]] == 0) {
                q.push(v[node][i]);
                depth[v[node][i]] = depth[node] + 1;
                viz[v[node][i]]++;
            }
        }
    }
    for(int i = 1; i <= n; i++) {
        rez = max(rez, depth[i]);
    }
    out << rez + 1;

}