#line 1 "/home/siro53/kyo-pro/compro_library/template/template.cpp"
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define FOR(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------
#line 2 "d.cpp"

const int MAX = 100000;
int N;
vector<int> G[MAX];
ll depth[MAX], sz[MAX], dp[MAX], ans[MAX];

ll pre_calc(int u, int p, int d) {
    depth[u] = d;
    ll res = 1;
    for(int v: G[u]) {
        if(v == p) continue;
        res += pre_calc(v, u, d+1);
    }
    return (sz[u] = res);
}

ll dfs1(int u, int p) {
    ll res = depth[u];
    for(int v: G[u]) {
        if(v == p) continue;
        res += dfs1(v, u);
    }
    return (dp[u] = res);
}

void calc_ans(int u, int p) {
    for(int v : G[u]) {
        if(v == p) continue;
        ans[v] = ans[u] - sz[v] + (sz[0] - sz[v]);
        calc_ans(v, u);
    }
}

int main() {
    cin >> N;
    REP(i, N - 1) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }

    pre_calc(0, -1, 1);
    dfs1(0, -1);

    ans[0] = dp[0];
    calc_ans(0, -1);

    ll res = 0;
    REP(i, N) res += ans[i];

    cout << res << endl;
}