#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using namespace std;

int N;
vector<int> g[101010];
int dp[101010][2];

void solve(int v, int p = -1) {
    dp[v][0] = 1;
    dp[v][1] = 0;

    for (auto u : g[v]) {
        if (u == p) continue;
        solve(u, v);

        dp[v][0] += max(dp[u][0] - 1, dp[u][1]);
        dp[v][1] += max(dp[u][0], dp[u][1]);
    }
}

int main() {
    cin >> N;
    rep(i, N-1) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    solve(0);
    cout << max(dp[0][0], dp[0][1]) << endl;
}