#include <bits/stdc++.h>

#define int long long
#define x first
#define y second

using namespace std;

signed main() {
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);

    int n, a, b;
    cin >> n;
    vector<set<int> > g(n + 1);
    vector<int> cnt(n + 1);
    for (int i = 0; i < n - 1; ++i) {
        cin >> a >> b;
        g[a].insert(b);
        g[b].insert(a);
        // cnt[a] += 1;
        // cnt[b] += 1;
    }

    set<pair<int, int> > t;
    int left = n; 
    for (int i = 1; i <= n; ++i) {
        if (g[i].size() == 1) {
            int p = *g[i].begin();
            t.insert({p, i});//???
            left -= 1;
        }
    }

    int ans = 0;
    while(true) {
        if(left == 0) {
            if (t.size() == 1) {
                ans += 2;
            } else {
                ans += 1;
            }
            break;
        } else {
            auto [_, v] = *t.begin();
            t.erase(t.begin());

            int p = *g[v].begin();
            int cc = g[p].size();

            if(cc == 2) {
                ans += 1;
                left -= 1;
                g[p].erase(v);
                int pp = *g[p].begin();
                g[pp].erase(p);
                if (g[pp].size() == 1) {
                    int ppp = *g[pp].begin();
                    left -= 1;
                    t.insert({ppp, pp});
                }
            } else {
                ans += 2;
                g[p].erase(v);
            }
        }
    }
    cout << ans << endl;


    return 0;
}