#include <bits/stdc++.h>

using namespace std;

#define fio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

typedef long long ll;
int N;
vector<vector<int> > susedia;

int solve(int v, int parent){
    if(susedia[v].size()==1 && susedia[v][0]==parent)return 0;
    if(susedia[v].size()==1 && parent==-1)return solve(susedia[v][0],v);
    int res=0;
    for(int son: susedia[v]){
        if(son==parent)continue;
        res+=solve(son,v);
    }
    res+=susedia[v].size()-2;
    return res;
}

int main() { fio
    cin>>N;
   susedia.resize(N);
    for(int i=0;i<N-1;i++){
        int x,y;cin>>x>>y;x--;y--;
        susedia[x].push_back(y);
        susedia[y].push_back(x);
    }
   cout<<solve(0,-1)<<endl;
    return 0;
}