#include <bits/stdc++.h>
using namespace std;
vector<int> graph[100005];
int main(){
    int n;
    cin >> n;
    for(int i = 0; i < n - 1; ++i){
        int a, b;
        cin >> a >> b;
        a = a - 1;
        b = b - 1;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    int64_t ans = 0;
    for(int i = 0; i < n; ++i){
        ans += max(0, (int)graph[i].size() - 2);
    }
    cout << ans << endl;
}