#include "bits/stdc++.h"
#define Rep(i,n) for(int i=0;i<n;i++)
#define For(i,n1,n2) for(int i=n1;i<n2;i++)
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define put(a) cout<<a<<endl;
#define all(a)  (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define TDARRAY(int,a,n,m) vector<vector<int>> a(n,vector<int>(m,0));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) {if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a, T b) {if(a>b){a=b;return 1;}return 0;}

int n;
vector<int> a;
vector<int> b;
vector<int> v;


int main(){
    cin >> n;
    a.resize(n-1);
    b.resize(n-1);
    v.resize(n);
    REP(i,n-1){
        cin >> a[i] >> b[i];
        a[i]--;
        b[i]--;
        v[a[i]]++;
        v[b[i]]++;
    }
    ll res = 0;
    REP(i,n){
        if(v[i]>2){
            res+=v[i]-2;
        }
    }
    put(res);
    return 0;
}