/**
 *    author:  MaGnsi0
 *    created: 07.02.2024 20:06:23
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n; cin >> n;
    vector<int> deg(n), ones(n);
    vector<set<int>> adj(n);
    for (int i = 0; i < n - 1; ++i) {
        int u; cin >> u; u--;
        int v; cin >> v; v--;
        adj[u].emplace(v);
        adj[v].emplace(u);
        deg[u]++, deg[v]++;
    }
    for (int v = 0; v < n; ++v) {
        for (int u : adj[v]) {
            ones[v] += deg[u] == 1;
        }

    }
    vector<bool> removed(n, false);
    set<pair<int, int>> can_remove;
    for (int i = 0; i < n; ++i) {
        if (deg[i] <= 1) {
            can_remove.emplace((deg[i] ? -ones[*adj[i].begin()] : 1), i);
        }
    }
    int ans = 0;
    while (!can_remove.empty()) {
        int v = can_remove.begin() -> second;
        can_remove.erase(can_remove.begin());
        if (removed[v]) { continue; }
        if (deg[v] == 0) {
            removed[v] = true;
            ans += 2;
        } else {
            int u = *adj[v].begin();
            if (deg[u] <= 2) {
                removed[v] = removed[u] = true;
                for (int x : adj[u]) {
                    if (removed[x]) { continue; }
                    deg[x]--; adj[x].erase(u);
                    if (deg[u] == 1) { ones[x]--; }
                    if (deg[x] <= 1) {
                        can_remove.emplace((deg[x] ? -ones[*adj[x].begin()] : 1), x);
                    }
                }
                ans++;
            } else {
                removed[v] = true;
                deg[u]--;
                adj[u].erase(v);
                if (deg[u] <= 1) {
                    can_remove.emplace((deg[u] ? -ones[*adj[u].begin()] : 1), u);
                }
                ans += 2;
            }
        }
    }
    cout << ans;
}