#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_set>
using namespace std;

int main(){
    int N;
    cin >> N;
    vector<vector<int>> G(N);
    vector<bool> visited(N,false);
    vector<int> back(N,-1);

    int start = -1;
    for(int i=0;i<N-1;i++){
        int a,b;
        cin >> a >> b;
        a--, b--;
        G[a].push_back(b);
        G[b].push_back(a);
        if(G[a].size() == 1) start = a;
        if(G[b].size() == 1) start = b;
    }

    queue<pair<int,int>> Q;
    Q.push({start,0});
    visited[start] = true;
    int end = 0;

    int dia = 0;
    while(!Q.empty()){
        pair<int,int> p = Q.front();
        Q.pop();

        for(int to : G[p.first]){
            if(visited[to]) continue;
            visited[to] = true;
            if(dia <= p.second+1){
                back[to] = p.first;
                end = to;
                dia = p.second+1;
            }
            Q.push({to,p.second+1});
        }
    }

    unordered_set<int> st;

    while(end != start){
        st.insert(end);
        end = back[end];
    }
    st.insert(start);
    
    int ans = 0;
    for(int i=0;i<N;i++){
        if(st.count(i)) continue;
        if(G[i].size() > 0){
            for(int to : G[i]){
                if(st.count(to)){
                    if(G[i].size() == 1) ans++;
                    else ans += G[i].size() - 1;
                    break;
                }
                else ans += G[i].size() - 1;
            }
        }
    }

    cout << ans << endl;

}