#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <queue>
#include <string>
#include <algorithm>

#define REP(i, n) for(ll i = 0; i < (n); i++)
#define INF 1e16
#define MOD 1e9 + 7

using namespace std;
using ll = long long;



int main() {
	ll n;
	cin >> n;
	vector<ll> cnt(n);
	REP(i, n - 1) {
		ll a, b;
		cin >> a >> b;
		a--; b--;
		cnt[a]++;
		cnt[b]++;
	}
	ll ans = 0;
	REP(i, n) {
		ans += max(0LL, cnt[i] - 2);
	}
	cout << ans << endl;
}