#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<vector<int>> graph(n);
  REP(_, n - 1) {
    int a, b; cin >> a >> b; --a; --b;
    graph[a].emplace_back(b);
    graph[b].emplace_back(a);
  }
  vector<int> sub(n, 1);
  vector<ll> dp(n, 1);
  auto f = [&](auto &&f, int par, int ver) -> void {
    for (int e : graph[ver]) {
      if (e != par) {
        f(f, ver, e);
        sub[ver] += sub[e];
        dp[ver] += dp[e] + sub[e];
      }
    }
  };
  f(f, -1, 0);
  auto g = [&](auto &&g, int par, int ver, int pd) -> void {
    dp[ver] += pd;
    for (int e : graph[ver]) {
      if (e != par) g(g, ver, e, dp[ver] - (dp[e] + sub[e]) + (n - sub[e]));
    }
  };
  g(g, -1, 0, 0);
  cout << accumulate(ALL(dp), 0LL) << '\n';
  return 0;
}