///Etfsh5t nseet el rank
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include "bits/stdc++.h"
using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b) for (int i = a; i < b; i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x, y)
#define popCnt(x) (__builtin_popcountll(x))
// #define int ll

using ll = long long;
using ull = unsigned long long;
using uint = uint32_t;
using ii = pair<int, int>;

const int N = 2e5 + 5, A = 12, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-9;
const int INF = 1e18;
vector<int> adj[N];
priority_queue<ii> pq[N];
int lvl[N];
int dfs(int node, int par)
{
    vector<int> children;
    int ans = 0;
    for (auto v : adj[node])
    {
        if (v == par)
            continue;
        lvl[v] = lvl[node] + 1;
        ans += dfs(v, node);
        children.push_back(v);
    }
    if (children.size() == 1)
    {
        int v = children[0];
        while (pq[v].top().F > lvl[node] + 1)
        {
            pq[v].pop();
            ans += 1;
        }
        pq[node].swap(pq[v]);
    }
    else if (children.size() == 2)
    {
        int u = children[1], v = children[0];
        while (pq[v].top().F > pq[u].top().F + 1)
        {
            ans += 1;
            pq[v].pop();
        }
        while (pq[v].top().F + 1 < pq[u].top().F)
        {
            ans += 1;
            pq[u].pop();
        }
        if (pq[u].size() > pq[v].size())
            swap(u, v);
        pq[node].swap(pq[v]);
        while (pq[u].size())
        {
            pq[node].push(pq[u].top());
            pq[u].pop();
        }
    }
    pq[node].push(make_pair(lvl[node], node));
    return ans;
}
void doWork()
{
    int n;
    cin >> n;
    f(i, 1, n)
    {
        int u, v;
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    cout << dfs(1, 1) << endl;
}
int32_t main()
{
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
    // cin >> t;
    while (t--)
    {
        doWork();
    }
    return 0;
}