#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

const int N = 2e5 + 5;
int dep[N];
int dp[N];
vector<int> G[N];
vector<int> H[N];
int cnt = 0;

void cal(int u) {
    if (dp[u] <= 0)cnt++;
    if (H[u].size() == 1) {
        int to = H[u][0];
        dp[to] = min({dep[to], dp[u] - 1, 1});
        cal(to);
    } else if (H[u].size() == 2) {
        for (int i = 0; i < 2; i++) {
            int r = H[u][i ^ 1];
            int to = H[u][i];
            dp[to] = min({dep[to], dep[r] + 1, dp[u] - 1});
            cal(to);
        }
    }
}

int dfs(int u, int fa) {
    int ans = 0;
    int ans2 = 1e9;
    for (int to: G[u]) {
        if (to == fa)continue;

        H[u].push_back(to);
        int ret = dfs(to, u);
        ans = max(ans, ret);
        ans2 = min(ans2, ret);
        dep[u] = max(dep[u], dep[to]);
    }
    dep[u]++;
    if (H[u].size() == 1) {
        return dp[u] = 2;
    } else if (H[u].size() == 0) {
        return dp[u] = 1;
    } else if (H[u].size() == 2) {
        return dp[u] = min(ans, ans2 + 1) + 1 ;
    }
    return 0;
}

int main() {
    ios::sync_with_stdio(false);

    int n;
    cin >> n;
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    int ans = dfs(1, 0);
    cal(1);

    cout << cnt << endl;
}