#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cstdio>
#include <utility> 
#include <queue>
#include <math.h>
#include <set>
#include <bitset>
#include <cmath>
#include <bitset>
#include <stack>
#include <cstring>
#include <math.h>
#include <iomanip>
#include <unordered_map>
#include <deque>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 200010;
set<int> graph[MAXN];
int rem[MAXN];
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int n; cin >> n;
    for(int i = 0; i < n - 1; i++) {
        int x, y; cin >> x >> y;
        graph[x].insert(y);
        graph[y].insert(x);
    }
    int ans = 0;
    deque<int> q;
    for(int i = 1; i <= n; i++) {
        if(graph[i].size() <= 1) {
            if(graph[i].size() == 1) {
                int y = *(graph[i].begin());
                if(graph[y].size() <= 2) q.push_front(i);
                else q.push_back(i);
            }
            else q.push_back(i);
        }
    }
    while(!q.empty()) {
        int x = q.front();
        q.pop_front();
        if(rem[x]) continue;
        rem[x] = 1;
        if(graph[x].size() == 0) ans += 2;
        else {
            int y = *(graph[x].begin());
            if(graph[y].size() <= 2) {
                rem[y] = 1;
                for(int z : graph[y]) {
                    if(rem[z]) continue;
                    graph[z].erase(y);
                    if(graph[z].size() <= 1) {
                        if(graph[z].size() == 1) {
                            int k = *(graph[z].begin());
                            if(graph[k].size() <= 2) q.push_front(z);
                            else q.push_back(z);
                        }
                        else q.push_back(z);
                    }
                }
                ans++;
            }
            else {
                graph[y].erase(x);
                ans += 2;
            }
        }
    }
    cout << ans << '\n';
}