import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;

void main() {
    int n;
    scan(n);

    auto adj = new int[][](n, 0);
    foreach (i ; 0 .. n-1) {
        int ai,bi;
        scan(ai,bi);
        adj[ai] ~= bi;
        adj[bi] ~= ai;
    }

    int dfs(int v, int p) {
        if (adj[v].length == 1) {
            return 0;
        }

        int res, dmax;
        bool zero;

        foreach (u ; adj[v]) {
            if (u == p) continue;
            int d = dfs(u, v);
            if (!d) {
                zero = 1;
                d++;
            }
            res += d;
        }

        if (zero) res--;
        return res;
    }

    int ans = 1;

    foreach (i ; 0 .. n) {
        if (adj[i].length > 2) {
            ans = dfs(i, -1);
            break;
        }
    }

    writeln(ans);
}






void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
