#include<bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using namespace std;

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

int main(){
  int n=ri();
  int x[n],y[n],sum=0;
  double s;
  rep(i,n) x[i]=ri(),y[i]=ri();
  rep(i,n-1){
    for(int j=i+1;j<n;j++){
      s=double(y[j]-y[i])/(x[j]-x[i]);
      if(abs(s)<=1)sum++;
    }
  }
  cout<<sum;
}
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;

int main()
{
    int N;
    vector<ll> A;
    cin >> N;
    rep(i, N)
    {
        int Ai;
        cin >> Ai;
        A.push_back(Ai);
    }
    int cnt_max = 0;
    int ans = 0;
    for (int i = 2; i <= *max_element(A.begin(), A.end()); i++)
    {
        int res = 0;
        for (ll j : A)
        {
            if (j % i == 0)
            {
                res += 1;
            }
        }
        if (res > cnt_max)
        {
            ans = i;
            cnt_max = res;
        }
    }
    cout << ans << endl;
}