#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int INF = 1e9;

vector<vector<int>> adj;

vector<int> allow;
vector<int> d;
vector<int> td;

void dfs1(int u, int p) {
    d[u] = p == -1 ? 0 : d[p] + 1;
    td[u] = d[u];

    int mna = INF;

    for (int v: adj[u]) {
        if (v != p) {
            dfs1(v, u);
            td[u] = max(td[u], td[v]);
            mna = min(mna, allow[v]);
        }
    } 

    if (p != -1 && adj[u].size() == 1) {
        allow[u] = d[u];
        return;
    }

    if (p == -1 && adj[u].size() == 0) {
        allow[u] = d[u];
        return;
    }

    if (p != -1 && adj[u].size() == 2) {
        allow[u] = d[u] + 1;
        return;
    }

    if (p == -1 && adj[u].size() == 1) {
        allow[u] = d[u] + 1;
        return;
    }

    allow[u] = min(td[u], mna + 1);
}

void dfs2(int u, int p) {
    if (p != -1) {
        allow[u] = min(allow[u], allow[p]);
    }
    for (int v: adj[u]) {
        if (v != p) {
            dfs2(v, u);
        }
    }
}

void solve() {
    int n;
    cin >> n;
    adj.assign(n, {});
    allow.assign(n, INF);
    d.assign(n, 0);
    td.assign(n, 0);

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

    int ans = 0;

    for (int i = 0; i < n; i++) {
        ans += (d[i] > allow[i]);
    }

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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    //cin >> t;
    while (t--) solve();
    return 0;
}