#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
using namespace std;
const int MAXN = 1e5 + 9;
const int MOD = (int)(1e9 + 7);
const int LOG2MAXN = 17;
const int INF = 1e9;
int di[] = {0, 1, 0, -1};
int dj[] = {1, 0, -1, 0};
char ddir[] = {'R', 'U', 'L', 'D'};
int n, m;
vector<vector<int> > gg;
bool used[MAXN];
long long dd[MAXN];
long long ans;
void input() {
  cin >> n;
  gg.resize(n);
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    gg[u].push_back(v);
    gg[v].push_back(u);
    dd[v]++;
    dd[u]++;
  }
}
void dfs(int v, int p = -1) {
  used[v] = 1;
  if (p != -1) {
    long long x = dd[v] - 1;
    ans += (x * (x - 1)) / 2;
  } else
    ans += (dd[v] * (dd[v] - 1)) / 2;
  used[v] = 1;
  for (auto to : gg[v]) {
    if (!used[to]) {
      ans += dd[to] - 1;
      dfs(to, v);
    }
  }
}
void solve() {
  dfs(0);
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  input();
  solve();
  return 0;
}
