#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long int;

int main() {
  int N;
  cin >> N;
  vector<vector<int>> g(N);
  rep(i, N-1) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  ll ans = 0;
  ans += N - 1;
  rep(i, N)
    ans += ((ll)g[i].size() * ((ll)g[i].size() - 1)) / 2;
  ll ans2 = 0;
  rep(i, N) {
    for (int j : g[i]) {
      ans2 += ((ll)g[i].size() - 1) * ((ll) g[j].size() - 1);
    }
  }
  cout << ans + ans2/2 << endl;
  return 0;
}