#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstring>
#include <vector>

using namespace std;

#define ll long long
#define ull unsigned long long
#define pb push_back
const int NMax = 1e5 + 5;
const ll inf = 1e18 + 7;

int N,ans;
vector<int> v[NMax];
// ans - distanta maxima dintre oricare doua noduri;
// v[i] - lista de adiacenta pentru nodul i;

void dfs(int,int,int);
// dfs - functie care realizeaza recursiv o parcurgere in adancime,
// aceasta se poate folosi pentru aflarea distantelor deoarece graful dat este un arbore;

int main() {
    FILE *in = fopen("darb.in","r"),
         *out = fopen("darb.out","w");

    fscanf(in,"%d",&N);
    for (int i=1;i < N;++i) {
        int x,y;
        fscanf(in,"%d%d",&x,&y);

        v[x].pb(y);
        v[y].pb(x);
    }

    ans = -1;
    for (int i=1;i <= N;++i) {
        dfs(i,0,1);
    }

    fprintf(out,"%d\n",ans);

    return 0;
}

void dfs(int node,int dad,int dist) {
    ans = max(ans,dist);

    for (int nxt : v[node]) {
        if (nxt == dad) {
            continue;
        }

        dfs(nxt,node,dist+1);
    }
}