#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))

int N;
map<int, vector<int>> edges;

vector<int> dp1, dp2;

int dfs1(int now, int prv)
{
    vector<int> tmp;
    for (auto nxt : edges[now]) if (nxt != prv)
    {
        tmp.push_back(dfs1(nxt, now));
    }
    int n_zero = 0, ans = 0;
    for (auto v : tmp)
    {
        ans += v;
        if (v == 0) n_zero++;
    }
    return dp1[now] = ans + max(n_zero - 1, 0);
}

void dfs2(int now, int prv)
{
    vector<int> n, v;
    int n_zero = 0;
    for (auto nxt : edges[now])if (nxt != prv)
    {
        n.push_back(nxt);
        v.push_back(dp1[nxt]);
        if (dp1[nxt] == 0) n_zero++;
    }
    if (prv != -1)
    {
        n.push_back(prv);
        v.push_back(dp2[now]);
        if (dp2[now] == 0) n_zero++;
    }
    // dbg(now);
    // dbg(n);
    // dbg(v);
    // dbg(n_zero);

    int tot = accumulate(ALL(v), 0);
    REP(i, n.size()) if (n[i] != prv)
    {
        dp2[n[i]] = tot - v[i] + max(n_zero - 1 - (dp1[n[i]] == 0), 0);
        // dbg(n[i]);
        // dbg(dp2[n[i]]);
    }
    for (auto nxt : edges[now]) if (nxt != prv) dfs2(nxt, now);
}

lint ans = 1E8;
void dfs3(int now, int prv)
{
    for (auto nxt : edges[now]) if (nxt != prv) dfs3(nxt, now);
    lint tmp = dp2[now] + 1, n_zero = (dp2[now] == 0);
    for (auto nxt : edges[now])
    {
        tmp += dp1[nxt];
        n_zero += (dp1[nxt] == 0);
    }
    mmin(ans, tmp + max(n_zero - 1, 0LL));
}

int main()
{
    cin >> N;
    REP(_, N - 1)
    {
        int a, b;
        cin >> a >> b;
        edges[a].push_back(b);
        edges[b].push_back(a);
    }
    dp1.resize(N);
    dfs1(0, -1);
    dp2.resize(N);
    dfs2(0, -1);
    int anx = 10000000;
    FOR(i, 0, N)
    {
        mmin(anx, dp1[i] + dp2[i] + 1);
    }
    // dbg(dp1);
    // dbg(dp2);
    // dfs3(0, -1);
    cout << anx << endl;
}


Measured memory_bytes: 33664