Problem:
Score : 900 points

Problem Statement

We have a tree with N vertices.
The vertices are numbered 0 through N - 1, and the i-th edge (0 ≤ i < N - 1) comnnects Vertex a_i and b_i.
For each pair of vertices u and v (0 ≤ u, v < N), we define the distance d(u, v) as the number of edges in the path u-v.

It is expected that one of the vertices will be invaded by aliens from outer space.
Snuke wants to immediately identify that vertex when the invasion happens.
To do so, he has decided to install an antenna on some vertices.

First, he decides the number of antennas, K (1 ≤ K ≤ N).
Then, he chooses K different vertices, x_0, x_1, ..., x_{K - 1}, on which he installs Antenna 0, 1, ..., K - 1, respectively.
If Vertex v is invaded by aliens, Antenna k (0 ≤ k < K) will output the distance d(x_k, v).
Based on these K outputs, Snuke will identify the vertex that is invaded.
Thus, in order to identify the invaded vertex no matter which one is invaded, the following condition must hold:

For each vertex u (0 ≤ u < N), consider the vector (d(x_0, u), ..., d(x_{K - 1}, u)). These N vectors are distinct.

Find the minumum value of K, the number of antennas, when the condition is satisfied.

Constraints

2 ≤ N ≤ 10^5

0 ≤ a_i, b_i < N

The given graph is a tree.

Input

Input is given from Standard Input in the following format:

N
a_0 b_0
a_1 b_1
:
a_{N - 2} b_{N - 2}

Output

Print the minumum value of K, the number of antennas, when the condition is satisfied.

Sample Input 1

5
0 1
0 2
0 3
3 4

Sample Output 1

2

For example, install an antenna on Vertex 1 and 3.
Then, the following five vectors are distinct:

(d(1, 0), d(3, 0)) = (1, 1)

(d(1, 1), d(3, 1)) = (0, 2)

(d(1, 2), d(3, 2)) = (2, 2)

(d(1, 3), d(3, 3)) = (2, 0)

(d(1, 4), d(3, 4)) = (3, 1)

Sample Input 2

2
0 1

Sample Output 2

1

For example, install an antenna on Vertex 0.

Sample Input 3

10
2 8
6 0
4 1
7 6
2 3
8 6
6 9
2 4
5 8

Sample Output 3

3

For example, install an antenna on Vertex 0, 4, 9.

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
using namespace std;
/// khodaya komak kon
/// ya navid navid
const int N=2e5+100;
vector <int> g[N];
ll dp[N][2];

ll dfs(ll v,ll p){
    ll p1=0;
    for (int i=0;i<g[v].size();i++){
        ll u=g[v][i];
        if (u==p){
            continue;
        }
        dfs(u,v);
        dp[v][1]+=dp[u][1];
        if (dp[u][1]==0){
            p1++;
        }
    }
    p1=max(p1-1,(ll)0);
    dp[v][1]+=p1;
    p1=0;
    vector <pair <int,pii> > a;
    for (int i=0;i<g[v].size();i++){
        ll u=g[v][i];
        if (u==p){
            continue;
        }
        p1=0;
        if (dp[u][1]==0){
            p1++;
        }
        a.pb({dp[u][0]-dp[u][1]-p1,{dp[u][1]-p1,u}});
    }
    sort(a.begin(),a.end());
    if (a.size()){
        dp[v][0]+=dp[a[0].S.S][0];
        for (int i=1;i<a.size();i++){
            dp[v][0]+=dp[a[i].S.S][1];
            if (dp[a[i].S.S][1]!=0){
                continue;
            }
            dp[v][0]++;
        }
    }
    dp[v][0]=min(dp[v][0],dp[v][1]+1);
    dp[v][0]=max(dp[v][0],(ll)1);
    dp[v][1]=min(dp[v][1],dp[v][0]);

    //cout << v << " " << dp[v][0] << " " << dp[v][1] << endl;
}
int32_t main(){
    ll n;
    cin >> n;
    ll ans=0;
    for (int i=0;i<n-1;i++){
        ll u,v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
    //cout << ans+1 << endl;
    vector <int> b;
    for (int i=0;i<n;i++){
        if (g[i].size()==1){
            b.pb(i);
        }
    }

    ll mi=1e9+100;
    for (int i=0;i<min((ll)1,(ll)b.size());i++){
        ll v=b[i];
        dfs(v,v);
        mi=min(mi,dp[g[v][0]][1]+1);
    }
    cout << mi;
}