#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("trapez.in");
ofstream fout("trapez.out");

struct punct
{
    long long x, y;
}v[1000005], p[1005];

int main()
{
    int n, k = 0;
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> p[i].x >> p[i].y;
    for (int i = 1; i < n; i++)
        for (int j = i + 1; j <= n; j++)
        {
            k++;
            v[k].x = p[j].x - p[i].x;
            v[k].y = p[j].y - p[i].y;
        }
    int nr = 0;
    for (int i = 1; i < k; i++)
        for (int j = i + 1; j <= k; j++)
            if (v[i].x * v[j].y == v[i].y * v[j].x)
                nr++;
    fout << nr << '\n';
    return 0;
}