#include<bits/stdc++.h>

#define forn(i,n) for(int i = 0; i< (int)n;++i)
#define for1(i,n) for(int i = 1; i<= (int)n;++i)
#define fore(i,l, r) for(int i = l; i<= r;++i)
#define all(a) a.begin(), a.end()
#define el '\n'
#define d(x) cerr<<#x<<" "<<x<<el
#define fi first
#define se second
#define pb push_back
using namespace std;

typedef vector<int> vi;
typedef pair<int,int> ii;
typedef long long ll;
// const int nax = 2e5+100;
const int nax = 2e3+100;
vi g[nax];

int dp[nax][2];// 1=> borrar todo subarbol
const int inf = 2e9;
void dfs(int u, int p = -1){
    dp[u][1] = inf;
    dp[u][0] = 0;
    for(int v: g[u]){
        if(v == p) continue;

        dfs(v,u);
        dp[u][0] = dp[u][0] + dp[v][1];
    }
    for(int v : g[u]){
        if(v == p) continue;

        dp[u][1] = min(dp[u][1], dp[u][0] - dp[v][1] + dp[v][0] + 1);
    }
    dp[u][1] = min(dp[u][1], dp[u][0] + 2);
}
void solve(){
    int n;
    cin>>n;
    forn(i,n-1){
        int u,v;
        cin>>u>>v;
        --u,--v;
        g[u].pb(v), g[v].pb(u);
    }
    dfs(0);
    cout<<dp[0][1]<<el;
}
int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int tt = 1;
    // cin>>tt;
    while(tt--){
        solve();
    }
}