#include <fstream>
#include <algorithm>
#include <math.h>
using namespace std;

double eps=0.00000000000001, def=1234.1234;

typedef struct
{
    double x,y;
} punct;

long double b[1100000];
int n,poz=-1,nr=0;
punct a[1100];

int main()
{
    ifstream f("trapez.in");
    ofstream g("trapez.out");
    f >> n;
    int i,j;

    for (i=0; i<n; i++)
        f >> a[i].x >> a[i].y;

    for (i=0; i<n-1; i++)
    for (j=i+1; j<n; j++)
        if (a[i].x-a[j].x==0) b[++poz]=def;
        else b[++poz]=(a[i].y-a[j].y)*1.0/(a[i].x-a[j].x);
    sort(b, b+(++poz));
    for (i=1; i<poz; i++)
        if (b[i]-b[i-1]<eps) nr++;
    g << nr;
    return 0;
}