#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<vector<int>> g(N);
	REP(i, N - 1) {
		int u, v;
		scanf("%d %d", &u, &v);
		--u; --v;
		g[u].emplace_back(v);
		g[v].emplace_back(u);
	}
	auto dfs = [&](auto self, int u, int p) -> pii { // first:削除されない, second:削除
		int a = 1, b = 0;
		for (int v : g[u]) {
			if (v == p) continue;
			auto res = self(self, v, u);
			a += res.second;
			b += max(res.first, res.second);
		}
		return {a, b};
	};
	auto ans = dfs(dfs, 0, -1);
	cout << max(ans.first, ans.second) << endl;
}