#include<math.h>
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("triang.in");
ofstream g("triang.out");

 void quickSort( float arr[10000], int left, int right)
 {
  int i = left, j = right;
  int tmp;
  float pivot = arr[(left + right) / 2];


  while (i <= j) {
        while (arr[i] < pivot)
              i++;
        while (arr[j] > pivot)
              j--;
        if (i <= j) {
              tmp = arr[i];
              arr[i] = arr[j];
              arr[j] = tmp;
              i++;
              j--;
    }
}

if (left < j)
    quickSort(arr, left, j);
if (i < right)
        quickSort(arr, i, right);
}
int main()
 {
     int n,i,j,c=0;
     int a[100],b[100];
     float v[10000];
     f>>n;
     for(i=1;i<=n;i++)
         f>>a[i]>>b[i];;
     for(i=1;i<n;i++)
         for(j=i+1;j<=n;j++)
         {
              c++;
              v[c]=sqrt((a[i]-a[j])*(a[i]-a[j])*1.000000+(b[i]-b[j])*(b[i]-b[j]));
         }
         int nr=0;

         for(i=1;i<=c;i++)
             g<<v[i]<<" ";
         g<<endl;
    quickSort(v,1,c);
    for(i=1;i<=n-2;i++)
        if(v[i]==v[i+1]&&v[i]==v[i+2])
            nr++;
        g<<nr;
        return 0;
}