#include<bits/stdc++.h>
int d[200005];
std::vector<int> G[200005];
bool vis[200005];
std::queue<int> que;
int getfa(int u) {
    for(auto t : G[u]) {
        if (!vis[t]) {
            return t;
        }
    }
    assert(0);
    return -1;
}
void rmv(int now) {
    // std::cout << "remove" << now << std::endl;
    for(auto i : G[now]) {
        d[i]--;
        if (d[i] == 1 && !vis[i]) {
            que.push(i);
        }
    }
}
int main() {
    // freopen("in.txt","r",stdin);
    int n;

    std::cin >> n;
    for(int i = 1; i < n; i++) {
        int x,y;
        std::cin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
        d[x]++,d[y]++;
    }
    for(int i = 1; i <= n; i++) {
        if (d[i] == 1) {
            que.push(i);
        }
    }
    int ans = 0;
    int cnt = 0;
    while(!que.empty() && cnt < n - 1) {
        auto top = que.front();
        // std::cout << top.second << std::endl;
        que.pop();
        if (vis[top]) continue;
        if (d[getfa(top)] <= 2) {
            // std::cout << "A" ;
            int u = top;
            int v = getfa(u);
            vis[u] = 1; vis[v] = 1;
            rmv(u),rmv(v);
            ans ++;
            cnt += 2;
        }
        else {
            // std::cout << "B" ;
            vis[top] = 1;
            rmv(top);
            ans += 2;
            cnt++;
        }
    }
    if (cnt == n - 1) {
        ans += 2;
    }
    std::cout << ans << std::endl;
}