/*
TASK:tri
LANG:C++
*/
#include<iostream>
#include<vector>
using namespace std;
vector <int> a[512];
int b[512][512]={0};
int main(){
    int n;
    cin >> n;
    int u,v;
    cin >> u >> v;
    while(u!=0){
                b[u][v]=1;
                b[v][u]=1;
                a[u].push_back(v);
                a[v].push_back(u);
                cin >> u >> v;}
    int br=0;
    for(int i=1;i<=n;i++)
            for(int j=0;j<a[i].size();j++)
            for(int k=0;k<a[a[i][j]].size();k++)
            if(a[a[i][j]][k]>a[i][j] && a[i][j]>i && b[a[a[i][j]][k]][i]==1) br++;
    cout << br << endl;
    return 0;
}
