#define taskname "H"
#include <bits/stdc++.h>
#define ii pair<int,int>
#define ff first
#define ss second

using namespace std;
const int maxn = 2e5 + 10;
vector<int> adj[maxn];
set<ii> mp[maxn];
int n, m, dp[maxn], dep[maxn], pa[maxn], ans = 0;

void DFS(int u = 1, int p = 0)
{
    bool f = ((u == 1 && adj[u].size() == 1) || (u != 1 && adj[u].size() == 2));
    for (int v: adj[u]) if (v != p)
    {
        dep[v] = dep[u] + 1;
        pa[v] = u;
        DFS(v, u);
        assert(!mp[v].empty());
        if (mp[u].empty())
        {
            swap(mp[u], mp[v]);
            if (f)
            {
                int mnu = dep[u], mxu = (--mp[u].end())->ff;
                while ((mxu - mnu) > 1)
                {
                    ii ed = *(--mp[u].end());
                    ans++;
                    mp[u].erase(ed);
                    ed.ss = pa[ed.ss];
                    ed.ff--;
                    mp[u].emplace(ed);
                    mxu = (--mp[u].end())->ff;
                }
            }
        }
        else
        {
            if (mp[u].size() > mp[v].size())
                for (auto [x, y]: mp[v]) mp[u].emplace(x, y);
            else
            {
                for (auto [x, y]: mp[u]) mp[v].emplace(x, y);
                swap(mp[u], mp[v]);
            }
            int mnu = mp[u].begin()->ff, mxu = (--mp[u].end())->ff;
            while ((mxu - mnu) > 1)
            {
                ii ed = *(--mp[u].end());
                ans++;
                mp[u].erase(ed);
                ed.ss = pa[ed.ss];
                ed.ff--;
                mp[u].emplace(ed);
                mxu = (--mp[u].end())->ff;
                mnu = mp[u].begin()->ff;
            }
        }
    }
    if (mp[u].empty()) mp[u].emplace(dep[u], u);
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cin>>n;
    for (int i=1, u, v; i<n; i++) cin>>u>>v, adj[u].emplace_back(v), adj[v].emplace_back(u);
    DFS();
    cout<<ans;
}
/**
9
1 2
1 3
2 4
2 5
4 6
4 7
5 8
5 9
**/