#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>

#include <iostream>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define INF64 1999999999999999999
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007

ll n, dp[110000][2];
vector<ll> e[200000];

void dfs(ll a, ll b) {
	REP(i, e[a].size()) {
		if (e[a][i] != b) {
			dfs(e[a][i], a);
			dp[a][0] += max(dp[e[a][i]][0], dp[e[a][i]][1]);
			dp[a][1] += max(dp[e[a][i]][0], dp[e[a][i]][1] - 1);
		}
	}
	dp[a][1]++;
}

int main() {
	cin >> n;
	REP(i, n - 1) {
		ll a, b;
		cin >> a >> b;
		a--; b--;
		e[a].push_back(b);
		e[b].push_back(a);
	}
	dfs(0, 0);
	cout << max(dp[0][0], dp[0][1]) << endl;
}