#include <fstream>
#include <cstdlib>
#include <map>
using namespace std;

typedef pair <int, int> coord;

const int N = 1005;

map <coord, bool> M;
coord v[N];
int n, p;

void get(coord a, coord b) {
    int Y = a.first - b.first, X = a.second - b.second;
    map <coord, bool> :: iterator it1, it2, it3, it4;
    it1 = M.find(make_pair (a.first + X, a.second - Y));
    it2 = M.find(make_pair (b.first + X, b.second - Y));
    it3 = M.find(make_pair (a.first - X, a.second + Y));
    it4 = M.find(make_pair (b.first - X, b.second + Y));
    if (it1 != M.end() && it2 != M.end()) p++;
    if (it3 != M.end() && it4 != M.end()) p++;
}

int main() {
    freopen ("patrate3.in", "r", stdin);
    ofstream fout ("patrate3.out");
    scanf ("%d ", &n);
    for (int i = 0; i < n; ++i) {
        int x, X, y, Y;
        scanf ("%d.%d", &x, &X);
        scanf ("%d.%d", &y, &Y);
        int a, b;
        a = x * 10000 + ((x > 0) ? +X : -X);
        b = y * 10000 + ((y > 0) ? +Y : -Y);
        a *= 10; b *= 10;
        v[i] = make_pair (a, b);
        M[v[i]] = 1;
    }
    for (int i = 1; i < n; ++i)
        for (int j = 0; j < i; ++j)
            get (v[j], v[i]);
    fout << (p >> 2);
}