#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
using ll = long long;
typedef pair<int,int> P;
typedef pair<P,ll> PP;
using Graph = vector<vector<ll> >;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;

Graph g;
ll n;
bool ok[100010];
ll dp[100010];

void dfs(int v,int p=-1){
    int deg = g[v].size();
    if(p!=-1&&deg==1){
        dp[v]=1;
        return;
    }
    int res = 0;
    for(int i=0;i<deg;i++){
        int u = g[v][i];
        if(u==p)continue;
        dfs(u,v);
        if(ok[u]){
            res += dp[u];
            ok[v]=false;
        }
        else{
            res += dp[u];
        }
    }
    if(ok[v])res++;
    dp[v]=res;
    return;
}


int main(){
    cin >> n;
    g.resize(n);
    rep(i,n)ok[i]=true;
    rep(I,n-1){
        int u,v;
        cin >> u >> v;
        u--;v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(0,-1);
    cout << dp[0] << endl;

    return 0;
}