/*
TASK:tri
LANG:C++
*/
#include<iostream>
using namespace std;
int main()
{
 int uk,i=0,n,a,fl,b,a1,a2,b1,b2,c1,c2,br=0,p,k;
 long long c[25000];
 cin>>n;
 do
 {
  cin>>a;
  cin>>b;
        
  if(a>b)
  {fl=0;
   for(p=0;p<i;p++)
    if(c[p]==1000*b+a)
     fl=1;
    if(fl==0)     
  {c[i]=1000*b+a;i++;}}
  else
  {fl=0;
   for(p=0;p<i;p++)
     if(c[p]==1000*a+b)
       fl=1;
   if(fl==0)       
  {c[i]=1000*a+b;
  i++;}}
 }   
 while(c[i-1] != 0);uk=i-1;
 for(i=0;i<=uk;i++)
   for(p=i+1;p<=uk;p++)
       for(k=p+1;k<=uk;k++)
         {
           if( (c[i]!=c[p]) && (c[i]!=c[k]) && (c[p]!=c[k]) )
          {a1=c[i]/1000;
           a2=c[i]%1000;
           b1=c[p]/1000;
           b2=c[p]%1000;
           c1=c[k]/1000;
           c2=c[k]%1000;
           if( (a1==b1) || (a1==b2) || (a1==c1) || (a1==c2) )
            if( (a2==b1) || (a2==b2)||(a2==c1)||(a2==c1) )
             if( (b1==a1) || (b1==a2)||(b1==c1)||(b1==c2) )
              if( (b2==a1)||(b2==a2)||(b2==c1)||(b2==c2) ) 
            br++;
          }
         }
   cout<<br<<endl;
 system("pause");
 return 0;   
}
