//#define _GLIBCXX_DEBUG
#include "bits/stdc++.h"

using namespace std;

//------------------------------- Libraries --------------------------------//

//------------------------------- Type Names -------------------------------//

using i64 = int_fast64_t;

using seika = string;
//akari : 1D, yukari : 2D, maki : 3D vector
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
//akane : ascending order, aoi : decending order
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha>
using aoi = priority_queue<kotonoha>;

//------------------------------- Dubug Functions ---------------------------//
inline void print()
{
    cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest)
{
    cout << first << ' ';
    print(rest...);
}
//------------------------------- Solver ------------------------------------//

void solve()
{
    int n;
    cin >> n;
    yukari<int> g(n);
    for (int i = 0; i < n - 1; i++)
    {
        int u, v;
        cin >> u >> v;
        u--, v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    yukari<int> dp(2, akari<int>(n));
    auto dfs = [&](auto &&dfs, int v = 0, int p = -1) -> void {
        dp[0][v] = 1;
        for (int nv : g[v])
        {
            if (nv == p)
            {
                continue;
            }
            dfs(dfs, nv, v);
            dp[1][v] += max(dp[1][nv], dp[0][nv]);
            dp[0][v] += max(dp[1][nv], dp[0][nv] - 1);
        }
    };
    dfs(dfs);
    cout << max(dp[0][0], dp[1][0]) << endl;
}

int main()
{
    solve();
    return 0;
}