#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
using ll = long long;

struct int2
{
	ll x;
	ll y;
};

int2 a;
int2 b;
vector<int2> points;
vector<pair<float, int>> aFunc;
vector<pair<float, int>> bFunc;
vector<int> sub;

static bool CompareA(pair<float, int> p, pair<float, int> q)
{
	return p.first < q.first;
}

static bool CompareB(pair<float, int> p, pair<float, int> q)
{
	return p.first > q.first;
}

int main()
{
	ll n;
	cin >> n;
	cin >> a.x >> a.y;
	cin >> b.x >> b.y;
	n -= 2;

	points.resize(n);
	aFunc.resize(n);
	bFunc.resize(n);
	sub.resize(n, 0);
	for (int i = 0; i < n; i++)
	{
		cin >> points[i].x >> points[i].y;

		if (points[i].y - a.y == 0) aFunc[i].first = 1000000000;
		else aFunc[i].first = (float)(points[i].x - a.x) / (points[i].y - a.y);
		if (points[i].y - b.y == 0) aFunc[i].first = 1000000000;
		else bFunc[i].first = (float)(points[i].x - b.x) / (points[i].y - b.y);

		aFunc[i].second = i;
		bFunc[i].second = i;
	}
	/*

	cout << endl;

	for (int i = 0; i < n; i++)
	{
	    cout << aFunc[i].first << " " << aFunc[i].second;
		cout << endl;
	}

	cout << endl;
	for (int i = 0; i < n; i++)
	{
		cout << bFunc[i].first << " " << bFunc[i].second;
		cout << endl;
	}
	*/
	sort(aFunc.begin(), aFunc.end(), CompareA);
	sort(bFunc.begin(), bFunc.end(), CompareB);

	/*
	cout << endl;
	for (int i = 0; i < n; i++)
	{
		cout << aFunc[i].first << " " << aFunc[i].second + 3;
		cout << endl;
	}

	cout << endl;
	for (int i = 0; i < n; i++)
	{
		cout << bFunc[i].first << " " << bFunc[i].second + 3;
		cout << endl;
	}
	*/
	int eqa = 0;
	int eqb = 0;
	for (int i = 0; i < n; i++)
	{
		if (i > 0) if (aFunc[i].first == aFunc[i - 1].first) eqa++;
		else eqa = 0;
		sub[aFunc[i].second] += i - eqa;
		if (i > 0) if (bFunc[i].first == bFunc[i - 1].first) eqb++;
		else eqb = 0;
		sub[bFunc[i].second] += i - eqb;
	}
	/*
	cout << endl;
	for (int i = 0; i < n; i++)
	{
		cout << i + 3 << ": " << sub[i] << "\n";
	}
	cout << endl;
	*/
	int maxim = -1;
	int save = -1;
	for (int i = 0; i < n; i++)
	{
		if (n - sub[i] + 2 > maxim)
		{
			maxim = n - sub[i] + 2;
			save = i + 3;
		}
	}

	cout << save << " " << maxim;
	return 0;
}