#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
vector<int> G[N];
int n;
ll dp[N][2]; // 0 表示为偶数 ; 1 表示为奇数
void dfs(int x, int fa) {
    int dep = 0;
    for (int to: G[x]) {
        if (to != fa) {
            dep++;
            dfs(to, x);
        }
    }
    if (dep == 0) {
        dp[x][0] = 0;
        dp[x][1] = INF;
    } else {
        for (int to: G[x]) {
            if (to != fa) {
                dp[x][0] += min({dp[to][0] + 1, dp[to][1]});
                dp[x][1] += dp[to][0];
            }
        }
    }

}

void solve() {
    cin >> n;
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    int p;
    for (int i = 1; i <= n; i++) {
        if (G[i].size() == 1) {
            p = i;
            break;
        }
    }
    dfs(p, p);
    cout << dp[p][0];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _ = 1;
//    cin >> _;
    for (int o = 1; o <= _; o++) {
//        cout << "Case #<<" << o << ": ";
        solve();
    }
    return 0;
}

/*



 */