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

#define F first
#define S second
#define ar array
typedef int uci;
#define int long long
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define ll long long
typedef pair<int, int> pii;
typedef vector<int> vi;

const int MAXN = 2e5+1;
set<int> adj[MAXN];

bool removed[MAXN];

void solve(){
    int n; cin >> n;
    set<int> leaves;

    for (int i = 0; i < n-1; i++) {
        int u, v; cin >> u >> v;
        adj[u].insert(v);
        adj[v].insert(u);
    }

    stack<pair<int, int>> rem;

    auto add = [&](int i) {
        if (size(adj[i]) == 1) {
            leaves.insert(i);
            if (size(adj[*adj[i].begin()]) <= 2) {
                rem.push({*adj[i].begin(), i});
            }
        }
    };

    for (int i = 1; i <= n; i++) {
        add(i);
    }

    int ans = 0;

    int num_removed = 0;
    while (num_removed != n) {
        if (not empty(rem)) {
            auto [a, b] = rem.top(); rem.pop();

            if (removed[a]) continue;

            ans++;
            
            if (b) {
                leaves.erase(b);
                removed[b] = true;
                num_removed++;
            }
            removed[a] = true;
            num_removed++;
            
            for (auto i: adj[a]) {
                if (i != b) {
                    adj[i].erase(a);
                    if (size(adj[i]) == 1) {
                        add(i);
                    }
                    else if (size(adj[i]) == 2) {
                        for (auto j: adj[i]) {
                            add(j);
                        }
                    }
                }
            }
        }
        else {
            ans++;
            rem.push({*leaves.begin(), 0});
        }
    }

    cout << ans << '\n';
}

uci main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    solve();
}