#include <bits/stdc++.h>

using namespace std;

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

int dp[100000][2];
vector<int> edges[100000];

int dfs(int v, int c, int par) {
  if (dp[v][c] != -1)
    return dp[v][c];

  int ret = 0;
  if (c) {
    ++ret;
    for (int w: edges[v]) {
      if (w == par) continue;
      ret += dfs(w, 0, v);
    }
  } else {
    for (int w: edges[v]) {
      if (w == par) continue;
      ret += max(dfs(w, 0, v), dfs(w, 1, v));
    }
  }

  return dp[v][c] = ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  REP (i, n-1) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    edges[u].push_back(v);
    edges[v].push_back(u);
  }

  memset(dp, -1, sizeof(dp));
  cout << max(dfs(0, 0, -1), dfs(0, 1, -1)) << endl;
  
  return 0;
}