#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<vector<int> > tree;
vector<int> dp;

void dfs(int u, int parent) {
    dp[u] = 1;
    for(int i=0;i<tree[u].size();i++)
	{
		int v=tree[u][i];
        if (v == parent) continue;
        dfs(v, u);
        dp[u] += dp[v];
    }
}

int main() {
    int n;
    cin >> n;
    tree.resize(n + 1);
    dp.resize(n + 1, 0);

    for (int i = 0; i < n - 1; ++i) {
        int x, y;
        cin >> x >> y;
        tree[x].push_back(y);
        tree[y].push_back(x);
    }

    dfs(1, -1);

    cout << dp[1] << endl;

    return 0;
}