#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
int n;
vector<int> G[1 << 17];
P mostfar(int root) {
	queue<int> q;
	vector<bool> used(n,0);
	used[root] = true;
	q.push(root);
	int cnt = -1; int ret = root;
	while (!q.empty()) {
		int len = q.size();
		rep(aa, len) {
			int x = q.front(); q.pop(); ret = x;
			rep(j, G[x].size()) {
				int to = G[x][j];
				if (used[to])continue;
				used[to] = true;
				q.push(to);
			}
		}
		cnt++;
	}
	return { ret,cnt };
}
void solve() {
	cin >> n;
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].push_back(b); G[b].push_back(a);
	}
	int ans = 0;
	rep(i, n) {
		ans += max(0, (int)G[i].size() - 2);
	}
	cout << ans << endl;
	//int l = mostfar(0).first;
	//cout << n-1-mostfar(l).second << endl;
}
int main() {
	solve();
	//stop
	return 0;
}