#include <stdio.h>
#include <algorithm>
int comp(long long int a,long long int b)
{
    return a<b;
}
int x[1001],y[1001];
long long int pante[500001];
int n;
int main()
{
    FILE *fin,*fout;
    fin=fopen("trapez.in","r");
    fout=fopen("trapez.out","w");
    fscanf(fin,"%d",&n);
    for(int i=1;i<=n;i++)
    {
            fscanf(fin,"%d%d",&x[i],&y[i]);
    }
    int pos=1;
    for(int i=1;i<=n;i++)
    {
            for(int j=i+1;j<=n;j++)
            {
                    if(x[j]!=x[i])
                    {
                                  pante[pos]=(y[j]-y[i])*100000/(x[j]-x[i]);
                                  pos++;
                    }
                    else
                    {
                        pante[pos]=0;
                        pos++;
                    }
            }
    }
    int count=0;
    std::sort(pante+1,pante+pos,comp);
    pos--;
    for(int i=1;i<pos;i++)
    {
            if(pante[i]==pante[i+1]) count++;
    }
    fprintf(fout,"%d\n",count);
}