#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

vector<vector<int>> g, dp;
void dfs(int u, int p) {
    dp[u][0] = 1;
    dp[u][1] = 0;
    for (int v: g[u]) if (v != p) {
        dfs(v, u);
        dp[u][0] += max(dp[v][0] - 1, dp[v][1]);
        dp[u][1] += max(dp[v][0], dp[v][1]);
    }
}

int main() {
    int n; cin >> n;
    g.resize(n);
    for (int i = 0; i < n - 1; i++) {
        int u, v; cin >> u >> v; u--, v--;
        g[u].emplace_back(v);
        g[v].emplace_back(u);
    }
    dp.assign(n, vector<int>(2));
    dfs(0, -1);
    cout << max(dp[0][0], dp[0][1]) << endl;
    return 0;
}