#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;
//const bool debug = false;
#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"
#define P pair<long long,long long>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<int>to[200005];
vector<P>dp(200005);
vector<P>dpR(200005);
void dfs(int v,int p = -1){
  P val ={1,1};
  for(auto nv :to[v]){
    if(p == nv)continue;
    dfs(nv,v);
    val.first += dp[nv].first + dp[nv].second;
    val.second += dp[nv].second;
  }
  dp[v] = val;
}
void dfsR(int v,int p = -1){
  dpR[v] = dp[v];
  if(-1 != p){
    P subp = dpR[p];
    subp.first -= dp[v].first + dp[v].second;
    subp.second -= dp[v].second;
    dpR[v].first += subp.first + subp.second;
    dpR[v].second += subp.second;
  } 
  for(auto nv :to[v]){
    if(p == nv)continue;
    dfsR(nv,v);
  }
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
  int n;cin >>n;
	rep(i,n-1) {
		int a, b;cin >> a >> b;a--;b--;
		to[a].push_back(b);
		to[b].push_back(a);
	}
	dfs(0);
  //rep(i,n)cout << dp[i].first <<" " << dp[i].second << endl;
  dfsR(0);
  //rep(i,n)cout << dpR[i].first <<" " << dpR[i].second << endl;
  long long ans = 0;
  rep(i,n)ans += dpR[i].first;
  cout << ans << endl;
  return 0;
}