#include <bits/stdc++.h>
#ifdef LOCAL
#include "./debug.cpp"
#else
#define debug(...)
#define print_line
#endif
using namespace std;
using ll = long long;

int main() {
    int N;
    cin >> N;
    vector<vector<int>> G(N);
    for (int i = 0; i < N - 1; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    ll ans = 0;
    for (int i = 0; i < N; i++) {
        queue<pair<int, int>> Q;
        set<int> S;
        Q.push(make_pair(i, 0));
        S.insert(i);
        while (!Q.empty()) {
            auto [now, d] = Q.front();
            Q.pop();

            ans++;
            if (d == 3) continue;
            for (int nxt : G[now]) {
                if (!S.count(nxt)) {
                    Q.push(make_pair(nxt, d + 1));
                    S.insert(nxt);
                }
            }
        }
    }

    ans -= N;
    ans /= 2;
    cout << ans << endl;
}