#include <bits/stdc++.h>
using namespace std;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<unordered_set<int>> Es(N, unordered_set<int>());
    for (int i = 0; i < N - 1; ++i){
        int u, v;
        cin >> u >> v;
        Es[u-1].insert(v-1);
        Es[v-1].insert(u-1);
    }
    vector<int> degree(N, 0);  // degree[i]=-1: deleted vertex
    vector<int> stack;
    for (int i = 0; i < N; ++i){
        degree[i] = Es[i].size();
        if (degree[i] == 1) stack.push_back(i);
    }
    while (stack.size() > 0){
        int v = stack.back();
        stack.pop_back();
        if (degree[v] != 1) continue;
        int u = *Es[v].begin();
        degree[u] = -1;
        for (int p: Es[u]){
            --degree[p];
            if (degree[p] == 1) stack.push_back(p);
            Es[p].erase(u);
        }
    }
    int ans = 0;
    for (int d: degree){
        if (d == 0) ++ans;
    }
    cout << ans << endl;
    return 0;
}