#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<vector<int>> E(N);
  for (int i = 0; i < N - 1; i++){
    int x, y;
    cin >> x >> y;
    x--;
    y--;
    E[x].push_back(y);
    E[y].push_back(x);
  }
  vector<int> p(N, -1);
  vector<vector<int>> c(N);
  vector<int> bfs;
  queue<int> Q;
  Q.push(0);
  while (!Q.empty()){
    int v = Q.front();
    Q.pop();
    bfs.push_back(v);
    for (int w : E[v]){
      if (w != p[v]){
        p[w] = v;
        c[v].push_back(w);
        Q.push(w);
      }
    }
  }
  reverse(bfs.begin(), bfs.end());
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    A[i] = c[i].size();
  }
  for (int v : bfs){
    if (A[v] >= 3 && v > 0){
      A[p[v]] += A[v] - 2;
      A[v] = 2;
    }
  }
  cout << N - max(A[0] - 2, 0) << endl;
}