#include using namespace std; typedef long long ll; typedef pair p_ll; template void debug(T itr1, T itr2) { auto now = itr1; while(now=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a> adj; vector> vpq; void marge(ll x, ll y) { if (vpq[x].size() cnt(2,-1); rep(i,2) { if (vpq[n].size()) { ma += vpq[n].top(); cnt[i] = vpq[n].top(); vpq[n].pop(); } } if (cnt[0]%2||cnt[1]%2) vpq[n].push(ma); else if (n==0) { vpq[n].push(ma-1); vpq[n].push(1); } else { vpq[n].push(ma-2); vpq[n].push(1); vpq[n].push(1); } } int main() { ll N; cin >> N; adj.resize(N); rep(i,N-1) { ll A, B; cin >> A >> B; A--; B--; adj[A].push_back(B); adj[B].push_back(A); } vpq.resize(N); dfs(); // while (vpq[0].size()) { cout << vpq[0].top() << " "; vpq[0] .pop(); cout << endl; } ll result = vpq[0].top(); cout << result << endl; return 0; }