#include<iostream>

 #include<cstdio>

 #include<algorithm>

 using namespace std;

 struct point

 {

     double x,y;

 };

 int main()

 {

     int T,i,j,n,p;

     cin>>T;

     double k;

     while(T--)

     {

         double X,Y;

         double b[]={};

         int w=,t=;

         point a[]={};

         cin>>n;

         for(i=;i<n;i++)

             cin>>a[i].x>>a[i].y;

         for(i=;i<n;i++)

             for(j=i+;j<n;j++)

             {

                 X=a[i].x-a[j].x;

                 Y=a[i].y-a[j].y;

                 if(X==)

                     continue;

                 k=Y/X;

                 b[w++]=k;

             }

         sort(b,b+w);

         t=unique(b,b+w)-b;

         cout<<t<<endl;

     }

 }