#include <bits/stdc++.h>

using namespace std;

int main() {
    int N;
    vector<vector<int>> neighbors;
    cin >> N;
    neighbors.resize(N + 1);
    for (int i = 1; i < N; i++) {
        int u, v;
        cin >> u >> v;
        neighbors[u].push_back(v);
        neighbors[v].push_back(u);
    }
    int leaves = 0;
    for (int i = 1; i <= N; i++) {
        if (neighbors[i].size() == 1) leaves++;
    }
    cout << (leaves - 2) << endl;
    return 0;
}