#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<unordered_map>
#include<random>
#include<array>
#include<cassert>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())


int n;
vector<int> edge[100000];


pair<int, int> dfs(int p,int u) {
	pair<int, int> ret(1, 0);

	for (int v : edge[u]) {
		if (p != v) {
			auto x = dfs(u, v);
			ret.first += x.second;
			ret.second += x.first;

		}
	}
	ret.first = max(ret.first, ret.second);
	return ret;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n;
	rep(i,n-1) {
		int u, v;
		cin >> u >> v;
		u--; v--;
		edge[u].push_back(v);
		edge[v].push_back(u);
	}

	auto x = dfs(-1, 0);
	cout << max(x.first, x.second) << endl;



	return 0;
}