#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> grh;
vector<int> dp, ep;
void dfs (int crr, int prt) {
  dp[crr] = 1;
  ep[crr] = 0;
  for (int nxt : grh[crr]) {
    if (nxt == prt) continue;
    dfs(nxt, crr);
    dp[crr] += ep[nxt];
    ep[crr] += max(dp[nxt], ep[nxt]);
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  grh.resize(n);
  dp.resize(n);
  ep.resize(n);
  for (int i = 0; i < n - 1; i++) {
    int s, t;
    cin >> s >> t;
    grh[--s].push_back(--t);
    grh[t].push_back(s);
  }
  dfs(0, 0);
  int ret = max(dp[0], ep[0]);
  cout << ret << '\n';
  return 0;
}