/*
TASK: tri
LANG: C++
*/

#include <cstdio>
using namespace std;

int N, meet[ 512 ][ 512 ];

void input() {
    
    scanf( "%d", &N );
    
    int from, to;
    
    while( scanf( "%d %d", &from, &to ) != EOF ) {
        
        if( from == 0 && to == 0 ) break;
        
        meet[ from-1 ][ to-1 ] = 1;
        meet[ to-1 ][ from-1 ] = 1;       
    }    
}

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

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