#include <iostream>
#include <vector>
#define maxn 100005
using namespace std;
vector <int> V[maxn];

ifstream cin("darb.in");
ofstream cout("darb.out");

int nr[maxn],n,x,y,nod,verificat[maxn],distanta;

void read(){
    cin>>x>>y;
    V[x].push_back(y);
    nr[x]++;
    V[y].push_back(x);
    nr[y]++;
}

void dfs(){
    distanta++;
    int ok=0;
    for(int i=0; i<nr[nod]&&ok==0; i++)
        if(verificat[V[nod][i]]==0){
            nod=V[nod][i];
            verificat[nod]=1;
            ok=1;
        }
    if(ok==0)
        return;
    dfs();
}

int main()
{
    cin>>n;
    for(int i=1; i<n; i++)
        read();
    nod=1;
    dfs();
    for(int i=1;i<=n; i++)
        verificat[i]=0;
    distanta=0;
    dfs();
    cout<<distanta;
    return 0;
}