#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream& operator<<(ostream& cout, vector<T> V) {
  cout << "[ ";
  for (auto v : V) cout << v << ' ';
  return cout << ']';
}
template <class L, class R>
ostream& operator<<(ostream& cout, pair<L, R> P) {
  return cout << '(' << P.first << ',' << P.second << ')';
}
long long int n;
vector<vector<long long int>> conn, dp;
vector<long long int> dist;
void dfs1(long long int root, long long int par, long long int d) {
  dist[root] = d;
  for (long long int i : conn[root]) {
    if (i == par) continue;
    dfs1(i, root, d + 1);
  }
}
void dfs2(long long int node, long long int par) {
  for (long long int i : conn[node]) {
    if (i == par) continue;
    dfs2(i, node);
  }
  dp[node][0] = 0;
  for (long long int i : conn[node]) {
    if (i == par) continue;
    dp[node][0] += dp[i][1];
  }
  long long int diff = (long long int)1e18;
  for (long long int i : conn[node]) {
    if (i == par) continue;
    diff = min(diff, dp[i][2] - dp[i][1]);
  }
  dp[node][1] = dp[node][0] + diff;
  dp[node][2] = 1;
  for (long long int i : conn[node]) {
    if (i == par) continue;
    dp[node][2] += dp[i][0];
  }
  dp[node][0] = min({dp[node][0], dp[node][1], dp[node][2]});
  dp[node][1] = min(dp[node][1], dp[node][2]);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  conn.resize(n);
  dist.resize(n);
  for (long long int i = 0; i < (n - 1); i++) {
    long long int x;
    cin >> x;
    long long int y;
    cin >> y;
    x--, y--;
    conn[x].push_back(y);
    conn[y].push_back(x);
  }
  dfs1(0, -1, 0);
  dp.resize(n, vector<long long int>(3, (long long int)1e18));
  dfs2(0, -1);
  long long int ans = 0;
  for (long long int i = 0; i < (n); i++)
    if (dist[i] == 2) ans += dp[i][0];
  cout << ans << '\n';
  cerr << "Time : " << 1000 * (long double)clock() / (long double)CLOCKS_PER_SEC
       << "ms\n";
  ;
}
