#include <bits/stdc++.h>
using namespace std;

vector<int> adj[100001];
int st[100001], ins[100001];
int fa[100001];
int ic[100001];
int cyc = 0;
void dfs(int u) {
    st[u] = ins[u] = 1;
    for (auto x : adj[u]) {
        fa[x] = u;
        if (!st[x]) dfs(x);
        else if (ins[x]) {
            for (int k = u;k != x;k = fa[k]) {
                ic[k] = 1, ++ cyc;
            }
            ic[x] = 1;
            ++ cyc;
        }
    }
    ins[u] = 0;
}
int d[100001];
int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int N;cin >> N;
    for (int i = 2;i <= N;i ++ ) {
        int x, y;cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
        ++ d[x];
        ++ d[y];
    }
    dfs(1);
    int c = 0;
    int p = 0;
    for (int i = 1;i <= N;i ++ ) 
        if (d[i] == 5) ++ c, p = i;
    int ans = 0;

    auto near = [&](int x, int y) {
        return fa[x] == y || fa[y] == x;
    };

    for (int i = 1;i <= N;i ++ ) 
        if (d[i] <= 3) 
            ans += (c == 2 ? 1 : (c == 1 ? 2 : cyc));
        else if (d[i] == 4) {
            if (ic[i]) {
                ans += (c == 2 ? 0 : (c == 1 ? (near(i, p) ? 1 : 0) : 2));
            }
        } 
    cout << ans << '\n';
}