#include<bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i=0;i<n;i++)

vector< int > G[200000];
int ans;
bool used[200000];

int dfs(int id) {
  int ret = 0;
  used[id] = true;
  rep(j, G[id].size()) {
    int to = G[id][j];
    if(used[to])continue;
    if(dfs(to) >= 2)ans++;
    else ret++;
  }
  ans += max(ret - 2, 0);
  ret = min(ret, 2);
  return ret;
}

int main() {
  int n;
  cin >> n;
  rep(i, n - 1) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  dfs(0);
  cout << ans << endl;
  return 0;
}