#include<bits/stdc++.h>
using namespace std;
#define V vector
#define all1(x) (x).begin() + 1, (x).end()
#define fi first
#define se second
#define pb push_back
typedef pair<int, int> pi;

void solve() {
    int n; cin >> n;
    if(n == 1) {
        cout << 2 << endl;
        return;
    }
    V<V<int>> e(n + 1);
    V<int> f(n + 1);
    for(int i =1 ; i < n; i++) {
        int a, b; cin >> a >> b;
        e[a].pb(b);
        e[b].pb(a);
    }
    V<int> dep(n + 1);
    V<int> d(n + 1);
    auto dfs = [&](int x, int p, auto dfs) -> void {
        f[x] = p;
        d[p]++;
        dep[x] = dep[p] + 1;
        for(auto y : e[x]) {
            if(y == p) continue;
            dfs(y, x, dfs);
        }
    };
    dfs(1, 0, dfs);
    multiset<pi> st;
    for(int i = 1; i <= n; i++) {
        st.insert({dep[i], i});
    }
    int ans = 0;
    while(st.size()) {
        auto it = prev(st.end());
        int x = it->se;
        if(d[f[x]] == 1) {
            st.erase(it), st.erase({f[x], dep[f[x]]});
            ans++;
        } else {
            d[f[x]]--;
            st.erase(it);
            ans += 2;
        }
    }
    cout << ans << endl;

}
int main() {
    // int t; cin >> t;
    int t = 1;
    while(t--) solve();
}