#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()

const int N = (int)3e5;

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}
ll gcd(ll a, ll b){
  if(b==0) return a;
  else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
  if(kaijo_memo.size() > n) return kaijo_memo[n];
  if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
  if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r){
  if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
  if(n < r || r < 0) return 0;
  ll ret = 1;
  ret *= kaijo(n); ret %= MOD;
  ret *= gyaku_kaijo(r); ret %= MOD;
  ret *= gyaku_kaijo(n-r); ret %= MOD;
  return ret;
}

vector<int> G[N];
bool check[N];
bool exist[N];
int minimize(int now){
  check[now] = true;
  int memo = -1;
  rep(i, G[now].size()){
  	if(check[G[now][i]]) continue;
  	G[now][i] = minimize(G[now][i]);
    memo = G[now][i];
  }
  if(G[now].size() == 2){
    exist[now] = false;
  	return memo;
  }else{
  	return now;
  }
}

int main(void){
  int n;
  cin>>n;
  if(n==2){
  	cout<<1<<endl;
  	return 0;
  }
  rep(i,n-1){
  	int a,b;cin>>a>>b;
  	G[a].push_back(b);
  	G[b].push_back(a);
  }
  rep(i,n){
  	check[i] = false;
    exist[i] = true;
  }
  int start = -1;
  rep(i,n){
  	if(G[i].size() >= 3){
  		start = i;
  		break;
  	}
  }
  if(start == -1){
    cout<<1<<endl;
    return 0;
  }
  minimize(start);
  exist[start] = true;
  ll ans = 0;
  rep(i,n){
    rep(j,G[i].size()){
      cerr<<G[i][j]<<" ";
    }
    cerr<<endl;
  }
  rep(j,n){
    check[j] = !exist[j];
  }
  queue<int> q;
  q.push(start);
  while(q.size() > 0){
    int i = q.front();q.pop();
    if(check[i]) continue;
    check[i] = true;
    rep(j,G[i].size()){
      q.push(G[i][j]);
    }
  	if(G[i].size() <= 1){
  		continue;
  	}
    int count = 0;
  	rep(j,G[i].size()){
  		int next = G[i][j];
  		if(G[next].size() == 1 && exist[next]){
        count++;
      }
  	}
    ans += max(0, count-1);
  }
  cerr<<"hoge"<<endl;
  cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 13952