#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n;
    cin >> n;
    
    if(n == 1){
        cout << "0\n";
        return 0;
    }
    vector<vector<int>> adj(n+1, vector<int>());
    for(int i=0; i<n-1; ++i){
        int x, y;
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    int leaf_count =0;
    for(int i=1; i<=n; ++i){
        if(i ==1){
            if(adj[i].size() ==0){
            }
            continue;
        }
        if(adj[i].size() ==1){
            leaf_count++;
        }
    }
    long long minimal_sum = (long long)(n-1) + (leaf_count /2);
    
    cout << minimal_sum;
}