#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <math.h>
#include <cmath>
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };
typedef tuple<ll, ll, ll>T;
typedef pair<ll,ll>pll;

vector<int>e[101010];
int del[101010];
int ans = 0;

void dfs(int n,int p){
	if (del[n] != -1)return;
	int ok = 0;
	fore(x, e[n]) {
		if (x != p) {
			dfs(x,n);
			ok = 1;
		}
	}
	if (!ok)del[n] = 0;
	int d = 0;
	fore(x, e[n]) {
		if (x != p && del[x] == 0) {
			d = 1;
			ans++;
		}
	}
	del[n] = d;
}


int main(){
	int n;
	cin >> n;
	memset(del, -1, sizeof(del));
	
	rep(i, 0, n - 1) {
		int u, v;
		cin >> u >> v;
		u--, v--;
		e[u].pb(v);
		e[v].pb(u);
	}
	dfs(0,-1);
	if (del[0] == 0)ans++;
	cout << ans << endl;
	
	return 0;
}