#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
vector<int>son[50001];
bool ismark[50001];
int ans[50001][2];
int nnum;
void dfs(int u){
	ismark[u]=true;
	for(int i=0;i<son[u].size();++i){
		int ss=son[u][i];
		if(ismark[ss]!=true){
			dfs(ss);
			ans[u][1]+=ans[ss][0];
			ans[u][0]+=max(ans[ss][1],ans[ss][0]);
		}
	}
	return;
}
int main(){
	freopen("vacation.in","r",stdin);
	freopen("vacation.out","w",stdout);
	cin>>nnum;
	for(int i=1;i<nnum;++i){
		int a,b;
		cin>>a>>b;
		son[a].push_back(b);
		son[b].push_back(a);
		ans[a][1]=1;
		ans[b][1]=1;
	}
	dfs(1);
	cout<<max(ans[1][1],ans[1][0])<<endl;
	return 0;
}