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

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1ll << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>

ll n, in[210000];
vector<ll> g[210000];
P p[210000];
int main(){
    cin >> n;
    REP(i, n - 1){
        ll  a, b;
        cin >> a >> b;
        a--;
        b--;
        g[a].push_back(b);
        g[b].push_back(a);
        p[i] = P(a, b);
        in[a]++;
        in[b]++;
    }
    ll ans = 0;
    //3
    REP(i, n - 1){
        ans += (in[p[i].first] - 1) * (in[p[i].second] - 1);
    } 
    // 2
    REP(i, n){
        ans += in[i] * (in[i] - 1) / 2;
    }
    // 1
    ans += n - 1;
    cout << ans << endl;
}