#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005, INF = 0x3f3f3f3f;
vector<int> edges[MAXN];
void add_edge(int from, int to) {
  edges[from].push_back(to);
  edges[to].push_back(from);
}
int n;
int depth[MAXN];
int dp[MAXN][3];
void dfs(int x, int y) {
  int diff = INF;
  for (auto i : edges[x])
    if (i != y) {
      depth[i] = depth[x] + 1;
      dfs(i, x);
      dp[x][0] += min(dp[i][0], dp[i][1]);
      dp[x][1] += min({dp[i][0], dp[i][1], dp[i][2]});
      dp[x][2] += min(dp[i][0], dp[i][1]);
      diff = min(diff, dp[i][1] - dp[i][0]);
    }
  dp[x][1] += (depth[x] > 1 ? 1 : 0);
  dp[x][0] += max(0, diff);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    add_edge(u, v);
  }
  dfs(1, 0);
  int ans = min({dp[1][0], dp[1][1], dp[1][2]});
  printf("%d\n", ans);
  return 0;
}
