#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("sse4.2")
using namespace std;
mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T, class U>
inline bool chmax(T &x, U y) {
  return x < y ? x = y, 1 : 0;
}
template <class T, class U>
inline bool chmin(T &x, U y) {
  return x > y ? x = y, 1 : 0;
}
template <class T>
inline void sort(T &a) {
  sort((a).begin(), (a).end());
}
template <class T>
inline void rsort(T &a) {
  sort((a).rbegin(), (a).rend());
}
template <class T>
inline void reverse(T &a) {
  reverse((a).begin(), (a).end());
}
template <class T, class U>
inline istream &operator>>(istream &str, pair<T, U> &p) {
  return str >> p.first >> p.second;
}
template <class T>
inline istream &operator>>(istream &str, vector<T> &a) {
  for (auto &i : a) str >> i;
  return str;
}
template <class T>
inline T sorted(T a) {
  sort(a);
  return a;
}
void read() {}
void print() {}
void println() { cout << '\n'; }
template <class T, class... U>
void read(T &x, U &...u) {
  cin >> x;
  read(u...);
}
template <class T, class... U>
void print(const T &x, const U &...u) {
  cout << x;
  print(u...);
}
template <class T, class... U>
void println(const T &x, const U &...u) {
  cout << x;
  println(u...);
}
vector<vector<int>> G;
pair<int, int> findfar(int v, int p = -1) {
  pair<int, int> ans = {0, v};
  for (auto i : G[v])
    if (i != p) {
      auto check = findfar(i, v);
      ++check.first;
      if (check.first > ans.first) ans = check;
    }
  return ans;
}
bool findpath(int v, int first, vector<int> &path, int p = -1) {
  if (v == first) {
    path.push_back(v);
    return true;
  }
  for (auto i : G[v])
    if (i != p) {
      if (findpath(i, first, path, v)) {
        path.push_back(v);
        return true;
      }
    }
  return false;
}
int count2(int v, int p = -1, int h = 0) {
  int ans = 0;
  if (h % 2 == 0) ++ans;
  for (auto i : G[v])
    if (i != p) ans += count2(i, v, h + 1);
  return ans;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(12);
  int n;
  read(n);
  G = vector<vector<int>>(n);
  for (int i = 1; i < n; ++i) {
    int u, v;
    read(u, v);
    --u, --v;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  auto ans = count2(0);
  println(min(ans, n - ans) - 1);
  return 0;
}
