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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

vector<int> edge[100010], child[100010];
int dp[100010][2][2];

void dfs(int i, int p){
  for(auto e: edge[i]){
    if(e == p)continue;
    child[i].pb(e);
    dfs(e, i);
  }
}

void calc(int i){
  if(sz(child[i]) == 0){
    dp[i][0][1] = 0;
    dp[i][1][0] = 1;
    return;
  }
  for(auto e: child[i])calc(e);
  if(sz(child[i]) == 1){
    rep(k, 2){
      rep(l, 2){
        dp[i][k][l] = dp[child[i][0]][k][l];
      }
    }
    return;
  }
  if(sz(child[i]) == 2){
    // j = 0
    dp[i][1][0] = 0;
    for(auto e: child[i]){
      dp[i][1][0] += min(dp[e][1][0], dp[e][1][1]);
    }
    // j = 1
    if(i > 0){
      dp[i][1][1] = inf;
      for(auto e: child[i]){
        chmin(dp[i][1][1], dp[i][1][0] - min(dp[e][1][0], dp[e][1][1]) + min(dp[e][0][0], dp[e][0][1]));
      }
    }else{
      int e1 = child[i][0], e2 = child[i][1];
      chmin(dp[i][1][0], dp[e1][1][0] + dp[e2][0][1]);
      chmin(dp[i][1][0], dp[e1][1][1] + dp[e2][0][1] + 1);
      chmin(dp[i][1][0], dp[e2][1][0] + dp[e1][0][1]);
      chmin(dp[i][1][0], dp[e2][1][1] + dp[e1][0][1] + 1);
    }
    return;
  }
  // j = 0
  dp[i][1][0] = 0;
  for(auto e: child[i]){
    dp[i][1][0] += min(dp[e][1][0], dp[e][1][1]);
  }
  // j = 1
  if(i > 0){
    dp[i][1][1] = inf;
    for(auto e: child[i]){
      chmin(dp[i][1][1], dp[i][1][0] - min(dp[e][1][0], dp[e][1][1]) + min(dp[e][0][0], dp[e][0][1]));
    }
  }else{
    int tmp = inf;
    for(auto e: child[i]){
      chmin(tmp, dp[i][1][0] - min(dp[e][1][0], dp[e][1][1]) + min(dp[e][0][0], dp[e][0][1]));
    }
    chmin(dp[i][1][0], tmp);
  }
}

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  rep(i, n - 1){
    int a, b; cin >> a >> b;
    edge[a].pb(b);
    edge[b].pb(a);
  }
  dfs(0, -1);
  rep(i, n){
    rep(k, 2){
      rep(l, 2){
        dp[i][k][l] = inf;
      }
    }
  }
  calc(0);
  /*
  rep(i, n){
    cerr << i;
    rep(k, 2){
      rep(l, 2){
        cerr << " " << dp[i][k][l];
      }
    }
    cerr << endl;
  }
  /*/
  int res = min(dp[0][1][0], dp[0][1][1] + 1);
  cout << res << endl;
  return 0;
}


Measured memory_bytes: 18944