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

int solve(vector<vector<int>> &G){
    int ans = 0;
    for(auto &p: G){
        if(p.size() > 2) ans += p.size()-2;
    }
    return ans;
}

int main(){
    int n;
    cin >> n;
    vector<vector<int>> G(n);
    for(int i = 0; i < n-1; i++){
        int a, b;
        cin >> a >> b;
        a--; b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }

    cout << solve(G) << endl;
    return 0;
}