#include<bits/stdc++.h>
using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> p(n);
    vector<vector<int>> g(n);
    vector<priority_queue<int>> t(n);
    function<int(int)> leader=[&](int v){
        if(p[v] <= 0)return v;
        return p[v] = leader(p[v]);
    };
    auto merge=[&](int u,int v){
        int x = leader(u), y = leader(v);
        if(-p[x] < -p[y]) swap(x, y);
        while(!t[y].empty()){
            t[x].push(t[y].top());
            t[y].pop();
        }
        p[x] += p[y];
        p[y] = x;
    };
    int u, v;
    for(int i = 1; i < n; i++){
        cin >> u >> v;
        g[--u].push_back(--v);
        g[v].push_back(u);
    }
    function<void(int,int)> dfs=[&](int v,int q){
        for(auto &&u:g[v]){
            if(u == q)continue;
            dfs(u, v);
            merge(u, v);
        }
        int add = 1, x = leader(v);
        for(int i = 0; i < 2; i++){
            if(!t[x].empty()){
                add += t[x].top();
                t[x].pop();
            }
        }
        t[x].push(add);
        p[x] = -t[x].size();
    };
    dfs(0, -1);
    cout << t[leader(0)].top() << endl;
}