#include <iostream>

const int MAXN = 1000005;
int adj[MAXN];
int nextNode[MAXN];
int adjSize = 0;
int depth[MAXN];

void addEdge(int u, int v) {
    adj[adjSize] = u;
    nextNode[adjSize] = v;
    adjSize++;
    adj[adjSize] = v;
    nextNode[adjSize] = u;
    adjSize++;
}

void dfs(int u, int parent) {
    for (int i = 0; i < adjSize; i++) {
        if (adj[i] == u) {
            int v = nextNode[i];
            if (v!= parent) {
                depth[v] = depth[u] + 1;
                dfs(v, u);
            }
        }
    }
}

int main() {
    int n;
    std::cin >> n;
    for (int i = 0; i < n - 1; i++) {
        int x, y;
        std::cin >> x >> y;
        addEdge(x, y);
    }
    depth[1] = 0;
    dfs(1, -1);
    int ans = 0;
    for (int i = 2; i <= n; i++) {
        ans += depth[i];
    }
    std::cout << ans << std::endl;
    return 0;
}