#include <bits/stdc++.h>
using namespace std;
using ll = long long;

struct Graph {
    struct Vertex { int n; };
    struct Edge { int i, n; };
    Graph(int n, int m) : v(n, { -1 }), e(m), n(n), m(0) {}
    void add_edge(int a, int b) {
        e[m] = { b, v[a].n };
        v[a].n = m;
        m++;
    }
    array<int, 2> dfs(int i, int p) {
        array<int, 2> r = { 0, 1 };
        for (int j = v[i].n; j >= 0; j = e[j].n) {
            Edge &o = e[j];
            if (o.i == p) continue;
            auto a = dfs(o.i, i);
            r[0] += a[1];
            r[1] += min(a[0], a[1]);
        }
        return r;
    }
    vector<Vertex> v;
    vector<Edge> e;
    int n, m;
};

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

    int n;
    cin >> n;

    Graph g(n, (n - 1) * 2);
    for (int i = 0; i < n - 1; i++) {
        int a, b;
        cin >> a >> b;
        a--; b--;

        g.add_edge(a, b);
        g.add_edge(b, a);
    }
    auto a = g.dfs(0, -1);

    cout << min(a[0], a[1]) << endl;

    return 0;
}