#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rp(i,a,b)        for(int i=a;i<b;i++)

const int N = 2e5+10;
vector<int> adj[N], vals;
vector<bool> used;
int resp = 0;

void dfs(int v, int p = -1){
    //cout << v << " " << resp << "!\n";
    for(auto ch : adj[v]) if(ch != p){
        dfs(ch, v);
    }
    for(auto ch : adj[v]) if(ch != p){
        if(vals[v] <= 2) break;
        if(vals[ch] == 1 && !used[ch]){
            used[ch] = true;
            vals[ch]--;
            vals[v]--;
            resp+=2;
        }
    }
    for(auto ch : adj[v]) if(ch != p){
        if(vals[ch] == 1 && !used[ch]){
            used[ch] = true;
            vals[v]--;
            used[v] = true;
            resp++;
        }
    }
    int temp = 0;
    for(auto ch : adj[v]) if(!used[ch]) temp++;
    vals[v] = temp;
    //cout << v << " " << resp << "?\n";
}

void solvetask(){
    int n;
    cin >> n;
    used.assign(n, false);
    vals.assign(n, 0);
    rp(i, 1, n){
        int u, v;
        cin >> u >> v;
        u--; v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    rp(i, 0, n) vals[i] = adj[i].size();
    dfs(0);
    rp(i, 0, n) if(!used[i]) resp+=2;
    cout << resp << "\n";
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    ll t = 1;
    while(t--) solvetask();
}