#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    ll n, ans=0;
    cin >> n;
    vector<pair<ll, ll>> e(n);
    vector<ll> deg(n);
    for (ll i = 0; i < n - 1; i++){
        ll a, b;
        cin >> a >> b;
        a--; b--;
        e[i] = {a, b};
        deg[a]++;
        deg[b]++;
    }

    //距離1=線路の数
    ans += n - 1;
    //距離2=各駅の次数C2
    for (int i=0; i<n; i++){
        ans += deg[i] * (deg[i] - 1) / 2;
    }
    //距離3=各線路の両端の次数-1の積
    for (int i=0; i<n-1; i++){
        ans += (deg[e[i].first] - 1) * (deg[e[i].second] - 1);
    }

    cout << ans << endl;

    return 0;
}