#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <atcoder/modint>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(n); i++)

using m32 = atcoder::static_modint<1'000'000'007>;

int main(){
  int N; cin >> N;
  vector<vector<int>> E(N);
  rep(i,N-1){
    int u,v; cin >> u >> v; u--; v--;
    E[u].push_back(v);
    E[v].push_back(u);
  }

  vector<int> I = {0};
  vector<int> P(N,-1);
  vector<int> D(N,0);
  rep(i,I.size()){
    int p = I[i];
    for(int e : E[p]) if(P[p] != e){
      P[e] = p;
      D[e] = D[p] + 1;
      I.push_back(e);
    }
  }

  vector<int> Z(N,1);
  for(int i=N-1; i>=1; i--) Z[P[I[i]]] += Z[I[i]];

  vector<int> maxBlack(N,N);
  rep(i,N) maxBlack[i] = min(Z[i],(Z[i]+D[i])/2);
  for(int i=N-1; i>=0; i--){
    int p = I[i];
    if(Z[p] <= D[p]){ maxBlack[p] = Z[p]; continue; }
    int sum = 0;
    for(int e : E[p]) if(P[p] != e) sum += maxBlack[e];
    maxBlack[p] = min(maxBlack[p], sum);
  }

  // rep(i,N) cout << maxBlack[i] << " "; cout << endl;

  int ans = min(N, maxBlack[0] * 2 + 1);
  cout << ans << endl;
  return 0;
}




struct ios_do_not_sync {
    ios_do_not_sync() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;