#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"

using pll = pair<long long, long long>;//自分のサイズ、それ以下のサイズの合計
template <typename T>
struct ReRooting
{
	using F = function<T(T, int)>;
	using F2 = function<T(T, T)>;
	int V;
	vector<vector<int>> G;
	vector<vector<T>> dp;
	// dp_v = g(merge(f(dp_c1,c1), f(dp_c2,c2), ..., f(dp_ck,ck)), v)
	F f, g;
	F2 merge;
	T mi; // identity of merge(マージの単位元)

	ReRooting() {}
	ReRooting(int V, F f, F2 merge, T mi, F g): V(V), f(f), merge(merge), mi(mi), g(g){
		G.resize(V);
		dp.resize(V);
	}

	void read_graph(int index = 1){
		int a, b;
		for (int i = 0; i < V - 1; ++i){
			cin >> a >> b;
			a -= index, b -= index;
			G[a].emplace_back(b);
			G[b].emplace_back(a);
		}
	}

	void add_edge(int a, int b){
		G[a].emplace_back(b);
		G[b].emplace_back(a);
	}

	T dfs1(int p, int v){
		T res = mi;
		for (int i = 0; i < G[v].size(); ++i){
			if (G[v][i] == p) {continue;}
			dp[v][i] = dfs1(v, G[v][i]);
			res = merge(res, f(dp[v][i], G[v][i]));
		}
		return g(res, v);
	}

	void dfs2(int p, int v, T from_par){
		for (int i = 0; i < G[v].size(); ++i){
			if (G[v][i] == p){
				dp[v][i] = from_par;
				break;
			}
		}
		vector<T> pR(G[v].size() + 1);//pR[i] = [i,G[v].size())
		pR[G[v].size()] = mi;
		for (int i = G[v].size(); i > 0; --i) {
			pR[i - 1] = merge(pR[i], f(dp[v][i - 1], G[v][i - 1]));
		}
		T pL = mi;
		for (int i = 0; i < G[v].size(); ++i){
			if (G[v][i] != p){
				T val = merge(pL, pR[i + 1]);//pL:=[0,i)
				dfs2(v, G[v][i], g(val, v));
			}
			pL = merge(pL, f(dp[v][i], G[v][i]));
		}
	}

	void calc(int root = 0){
		for (int i = 0; i < V; ++i) { dp[i].resize(G[i].size()); }
		dfs1(-1, root);
		dfs2(-1, root, mi);
	}

	T solve(int v){
		T ans = mi;
		for (int i = 0; i < G[v].size(); ++i) {
			ans = merge(ans, f(dp[v][i], G[v][i]));
		}
		return g(ans, v);
	}
};

int main(){
	int N;
	cin >> N;
	//★↓編集
	auto f = [](pll p, int temp) { return p; };
	auto merge = [](pll p, pll q) { return pll{ p.first + q.first, p.second + q.second }; };
	auto g = [](pll p, int temp) { return pll{ p.first + 1, p.second + p.first + 1 }; };
	pll midx = { 0,0 };
	//★↑編集
	ReRooting<pll> re(N, f, merge, midx, g);
	re.read_graph();
	re.calc();
	long long sum = 0;
	rep(i, N) {
		sum += re.solve(i).second;
	}
	cout << sum << endl;
}