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

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

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);
	}
	using P = pair<int, int>;
	using T = tuple<int, int, int>;
	set<P> st;
	rep(i, N) {
		queue<T> q;
		q.push(T(i, 0, -1));
		while(q.size()) {
			int u, d, p;
			tie(u, d, p) = q.front();
			q.pop();
			if(d > 2) continue;
			for( int e : g[u]) {
				if(e == p) continue;
				int a = e;
				int b = i;
				if(a > b) swap(a, b);
				st.insert(P(a, b));
				if(d + 1 < 3) q.push(T(e, d + 1, u));
			}
		}
	}
	cout << st.size() << endl;
}