#include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;

int N;
vector<int> G[100100];

pair<int, int> go(int x, int l)
{
	pair<int, int> res = {1,0};
	for (auto &y : G[x]) if (y != l){
		auto u = go(y,x);
		res.first += max(u.first-1,u.second);
		res.second += max(u.first,u.second);
	}
	return res;
}

int main()
{
	scanf ("%d",&N);
	for (int i=1;i<N;i++){
		int x,y; scanf ("%d %d",&x,&y);
		G[x].push_back(y);
		G[y].push_back(x);
	}

	auto p = go(1,0);
	printf ("%d\n",max(p.first,p.second));
	return 0;
}