#include <fstream>
#include <vector>
#include <cstring>

using namespace  std;
const int N = 100005;
vector <int > L[N];
int ans, x , y , n;
int node, viz[N], maxim,dist;
ifstream cin("darb.in");
ofstream cout("darb.out");
void dfs(int x)
{
    viz[x] = 1;
    for(int i : L[x])
        if(!viz[i])
            dist++, dfs(i), dist--;
    if(L[x].size()== 1 and maxim < dist)
    {
        node = x;
        maxim = dist;
    }
}
int main() {
    cin >> n;
    for(int i =1 ;i <= n - 1 ;i ++)
    {
        cin >> x >> y;
        L[x].push_back(y);
        L[y].push_back(x);
    }
    dfs(1);
    memset(viz, 0 , sizeof(viz));
    dfs(node);
    cout << maxim + 1;
    return 0;
}