#include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 100010;

int n;
vector<int> G[MAX];
lint ans[MAX], sz[MAX];

void sz_dfs(int v, int pv) {
    sz[v] = 1;
    for (auto nv : G[v])
        if (nv != pv) {
            sz_dfs(nv, v);
            sz[v] += sz[nv];
            ans[v] += ans[nv];
        }
    ans[v] += sz[v];
}

void reroot_dfs(int v, int pv, lint par) {
    ans[v] += par;
    lint sum = 0;
    for (auto nv : G[v])
        if (nv != pv) sum += ans[nv];
    for (auto nv : G[v])
        if (nv != pv) {
            reroot_dfs(nv, v, par + sum - ans[nv] + n - sz[nv]);
        }
}

int main() {
    scanf("%d", &n);
    rep(i, n - 1) {
        int a, b;
        scanf("%d%d", &a, &b);
        --a;
        --b;
        G[a].push_back(b);
        G[b].push_back(a);
    }

    sz_dfs(0, -1);
    reroot_dfs(0, -1, 0);
    lint sum = 0;
    rep(i, n) sum += ans[i] + n - sz[i];
    printf("%lld\n", sum);
}