#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const int vx[]={1,0,-1,0}, vy[]={0,1,0,-1};
const ll LINF=1e18;
const ld PI=abs(acos(-1));

vector<int> g[100010];
bool used[100010][2];
int dp[100010][2];
//dp[v][0] := vを根とする部分木で, vを消す場合
//dp[v][1] := vを根とする部分木で, vを消さない場合

int dfs(int v, int par, bool f){
	if(used[v][f]) return dp[v][f]; used[v][f] = true;
	
	int ret = f;
	if(f){
		for(auto e:g[v]){
			if(e == par) continue;
			ret += max(dfs(e, v, 0), dfs(e, v, 1) - 1);
		}
	}else{
		for(auto e:g[v]){
			if(e == par) continue;
			ret += max(dfs(e, v, 0), dfs(e, v, 1));
		}
	}

	return dp[v][f] = ret;
}

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