#include <bits/stdc++.h>
using namespace std;
const int INF = 1061109567;
const long long LINF = 4557430888798830399ll;
const int MOD = 1000000007;
template <typename T>
void read(T &x) {
  x = 0;
  char c = getchar();
  if (c == EOF) exit(0);
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) {
    x = x * 10 + (c - '0');
    c = getchar();
  }
  assert(c != EOF);
}
int reads(char *s) {
  int l = 0;
  *s = getchar();
  if (*s == EOF) exit(0);
  while (*s != ' ' && *s != '\t' && *s != '\r' && *s != '\n' && *s != EOF) {
    ++s;
    ++l;
    *s = getchar();
  }
  assert(*s != EOF);
  *s = '\0';
  return l;
}
long long qpow(long long x, long long n) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % MOD;
    x = x * x % MOD;
    n >>= 1;
  }
  return res;
}
vector<int> G[200005];
int P[200005];
queue<int> Q;
bool vis[200005];
void dfs(int u, int p, int dep) {
  P[u] = p;
  for (auto &v : G[u]) {
    if (v == p) continue;
    dfs(v, u, dep + 1);
  }
  if (dep > 2) Q.push(u);
}
void test_case() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n - 1; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  dfs(1, -1, 0);
  int cnt = 0;
  while (!Q.empty()) {
    int u = Q.front();
    Q.pop();
    if (vis[u]) continue;
    ++cnt;
    int p = P[u];
    vis[p] = 1;
    for (auto &v : G[p]) vis[v] = 1;
  }
  printf("%d\n", cnt);
}
int main() {
  int t = 1;
  for (int i = 1; i <= t; ++i) {
    test_case();
  }
}
