#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	ll n;cin>>n;
	vector<vi> adj(n);
	rep(i,0,n-1){
		int u,v;cin>>u>>v;u--;v--;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	ll c[2]={};
	function<void(int,int,int)> dfs = [&](int u, int p, int co){
		c[co]++;
		for(int v:adj[u]){
			if(v==p)continue;
			dfs(v,u,co^1);
		}
	};
	dfs(0,-1,0);
	ll d=abs(c[1]-c[0]);
	cout<<(d+(n+d)/2)<<"\n";
}