/*
TASK: tri
LANG: C
*/
#include <stdio.h>

int a[512][512];
int n;

void read()
{
    int x,y;
    scanf ("%d",&n);
    
    scanf ("%d%d",&x,&y);
    
    while (x || y)
    {
        a[x][y] = 1;
        a[y][x] = 1;
        scanf ("%d%d",&x,&y);
    }
}

void solve()
{
    int i,j,k;
    int ans;
    
    ans = 0;
    
    for (i=1;i<=n;i++)
    {
        for (j=i+1;j<=n;j++)
        {
            for (k=j+1;k<=n;k++)
            {
                if (a[i][j] && a[i][k] && a[j][k])
                {
                    ans++;
                }
            }
        }
    }
    
    printf ("%d\n",ans);
}

int main()
{
    read();
    solve();
    return 0;
}
