#include <bits/stdc++.h>
using namespace std;;
#define ll long long
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define INF 1<<30
#define LINF 1LL<<62
#define all(x) (x).begin(), (x).end()
const int MOD = 1000000007;
 
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

ll num[100005];
int main(){
    ll n; 
    cin >> n;
    REP(i,n-1){
        ll a,b; cin >> a >> b;
        a--; b--;
        num[a]++;
        num[b]++;
    }
    ll one = 0;
    REP(i,n){
        if(num[i]==1)one++;
    }
    cout << one - 2 << endl;
}