#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#include <time.h>
#define _USE_MATH_DEFINES
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
typedef complex<double> xy_t;
typedef vector<ll> vll;
typedef vector< vector<ll> > matrix;
#define REP(i, x, y) for(ll i = (ll)x; i < (ll)y; i++)
#define DREP(i, x, y, d) for(ll i = (ll)x; i < (ll)y; i += (ll)d)
#define PER(i, x, y) for(ll i = (ll)x; i > (ll)y; i--)
#define DPER(i, x, y, d) for(ll i = (ll)x; i > (ll)y; i -= (ll)d)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int iinf = intmax / 8;
ll inf = llmax / 8;
double eps = 1e-12;

struct edge {
    ll to, cost;
};

int V;
vector<edge> G[1000000];
ll d[1000000];

void addedge(int st, int ed, ll co) {
    edge e;
    e.to = ed;
    e.cost = co;
    G[st].push_back(e);
}

//根付き木を作る。parentVectorに親nodeの番号が入る。
//parentVector[root] = -1
//treeRankVectorにはnodeのrankが入る。rootのrankは0
vector<ll> par;
vector<ll> treeRank;
void makeRootedTree(vector<ll> &parentVector, vector<ll> &treeRankVector, ll vecSize, ll root) {
    parentVector = vector<ll>(vecSize);
    treeRankVector = vector<ll>(vecSize);
    assert(root < (ll)parentVector.size());
    parentVector[root] = -1;
    treeRankVector[root] = 0;
    queue<ll> que;
    que.push(root);
    while (!que.empty()) {
        ll node = que.front();
        que.pop();
        REP (i, 0, G[node].size()) {
            edge e = G[node][i];
            if (e.to != parentVector[node]) {
                parentVector[e.to] = node;
                treeRankVector[e.to] = treeRankVector[node] + 1;
                que.push(e.to);
            }
        }
    }
}

ll ans = 0;
vector<bool> ant;
vector<bool> lastPlus;
//根付き木の葉から根に向かって何か処理をする
void leafToRoot(vector<ll> &parentVector, ll root) {
    ant = vector<bool>(parentVector.size(), false);
    lastPlus = vector<bool>(parentVector.size(), true);
    queue<ll> que;
    vector<ll> used(parentVector.size());
    fill(used.begin(), used.end(), 0);
    REP(i, 0, parentVector.size()) {
        if (i != root && G[i].size() == 1) {
            que.push(i);
            used[i] = 1;
        }
    }
    while (!que.empty()) {
        ll node = que.front();
        que.pop();

        //rootも含めて子だけのときに何かやりたいときはここに書く
        if (G[node].size() >= 3) {
            ll num = 0;
            REP(i, 0, G[node].size()) {
                edge e = G[node][i];
                if (e.to != par[node] && ant[e.to]) {
                    num++;
                }
            }
            if (num == G[node].size() - 1) {
                lastPlus[node] = false;
            } else {
                ans += G[node].size() - 2 - num;
                lastPlus[node] = true;
            }
            ant[node] = true;
        } else if (G[node].size() == 2) {
            REP(i, 0, G[node].size()) {
                edge e = G[node][i];
                if (e.to != par[node]) {
                    ant[node] = ant[e.to];
                    lastPlus[node] = lastPlus[e.to];
                }
            }
        }

        if (node == root) {
            edge e = G[node][0];
            lastPlus[node] = lastPlus[e.to];
            if (lastPlus[node]) {
                ans++;
            }
            break;
        }
        ll parent = parentVector[node];
        used[parent]++;

        //ここに書く

        if ((parent == root && used[parent] == (ll)G[parent].size()) ||
            (parent != root && used[parent] == (ll)G[parent].size() - 1)) {
            que.push(parent);
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N;
    cin >> N;
    V = N;
    REP(i, 0, N - 1) {
        ll a, b;
        cin >> a >> b;
        addedge(a, b, 1);
        addedge(b, a, 1);
    }
    ll root = -1;
    REP(i, 0, N) {
        if (G[i].size() == 1) {
            root = i;
            break;
        }
    }
    makeRootedTree(par, treeRank, N, root);
    leafToRoot(par, root);
    cout << ans << endl;
}


Measured memory_bytes: 33924