// UW BLACK
#include <bits/stdc++.h>

#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)((x).size()))
#define rep(i,a,b) for(int i=(a);i<(b);++i)

using namespace std;

using ll = long long;
using ld = long double;
using vi = vector<int>;
using pii = pair<int,int>;

mt19937 rnd(223);

clock_t TIME0;

#define TIME ((clock() - TIME0) * 1.0 / CLOCKS_PER_SEC)

constexpr int maxn = 1e6 + 100, inf = 1e9 + 100;
using T = long double;
constexpr T EPS = 1e-9;

const ll mod = 1e9+7;

bool rem[maxn];
int deg[maxn];
vi g[maxn];
void solve() {
    int n;
    cin >> n;
    for(int i = 0; i < n - 1; ++i) {
        int a,b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    priority_queue<pii> lfs;
    for(int i=1;i<=n;i++){
        deg[i] = g[i].size();
    }
    for(int i=1;i<=n;i++){
        if(deg[i]<=1){
            if(deg[i]==0){
                lfs.push({-1,i});
                continue;
            }
            int j = g[i][0];
            if(deg[j]<=2){
                lfs.push({j,i});
            }
            else lfs.push({-1,i});
        }
    }
    int ans = 0;
    while(lfs.size()){
        auto [z,x] = lfs.top();
        lfs.pop();
        if(rem[x])continue;
        if(z!=-1&&rem[z]){
            lfs.push({-1,x});
            continue;
        }
        if(z==-1)ans += 2;
        else ans +=1;
        rem[x]=true;
        if(z!=-1)rem[z]=true;
        if(z!=-1)x=z;
        for(int y:g[x])if(!rem[y]){
            deg[y]--;
            if(deg[y]<=1){
                int oy=-1;
                for(int yy : g[y])if(!rem[yy]){
                    if(deg[yy]<=2)oy=yy;
                }
                lfs.push({oy,y});
            }
            if(deg[y]<=2){
                for(int yy : g[y])if(!rem[yy]){
                    if(deg[yy]<=1){
                        lfs.push({y,yy});
                    }
                }
            }
        }
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed;
    cout.precision(20);
    TIME0 = clock();
    int k=1;
    // cin >> k;
    while(k--)
        solve();
    cerr << "\n\nConsumed " << TIME << endl;
}