#include <bits/stdc++.h>
using namespace std;

int N;
const int MAX = 100000;
vector<int> edges[MAX];
bool used[MAX];
int path = 0;

void dfs(int i, int p){
    int c = 0;
    for(auto j : edges[i]){
        if(j == p) continue;
        dfs(j, i);
        if(used[j]) continue;
        c++;
    }
    if(c >= 2){
        path += c-1;
        used[i] = true;
    }
}

int main(){
    cin >> N;
    for(int i=0; i<N-1; i++){
        int a, b;
        scanf("%d %d", &a, &b);
        edges[a-1].push_back(b-1);
        edges[b-1].push_back(a-1);
    }

    dfs(0, -1);
    if(!used[0]) path++;
    if(path <= 3){
        cout << path-1 << endl;
    }else{
        cout << 2*path-4 << endl;
    }
    return 0;
}