/* 
 * Problem: NOI Winter Camp 2010 efield
 * Author: Guo Jiabao
 * Time: 2010.3.15 12:21
 * Label: Solved
 * Memo: Computing Geometry + Convex Hull + Graham Scan
*/
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <vector>
#include <list>
#include <deque>
#include <string>
#include <queue>

#define var(a,b) typeof(b) a(b)
#define foreach(a,b) for (var(a,b.begin());a!=b.end();++a)
using std::sort;

const int MAXN = 50002;

struct point
{
	double x,y;
	int id;
};

int N,ipole;
point P[MAXN],pole,convex[MAXN],A[MAXN];

point operator -(const point &a,const point &b)
{
	point t={a.x-b.x,a.y-b.y,0};
	return t;
}

double operator *(const point &a,const point &b)
{
	return a.x*b.y - b.x*a.y;
}

void init()
{
	freopen("efield.in","r",stdin);
	freopen("efield.out","w",stdout);
	scanf("%d",&N);
	ipole=0;
	for (int i=1;i<=N;i++)
	{
		double m,c;
		scanf("%lf%lf",&m,&c);
		P[i].x = m*c;
		P[i].y = m;
		P[i].id = i;
		if (P[i].y > P[ipole].y)
			ipole = i;
	}
	pole = P[ipole];
	P[ipole] = P[N--];
}

bool cmp(const point &a,const point &b)
{
	point p = a - pole;
	point q = b - pole;
	double fc = p * q;
	if (fc > 0)
		return true;
	if (fc < 0)
		return false;
	return (p.x * p.x + p.y * p.y > q.x * q.x + q.y * q.y);
}

void graham()
{
	int top;
	sort(&P[1],&P[N+1],cmp);
	convex[1] = pole;
	convex[top=2] = P[1];
	for (int i=2;i<=N;i++)
	{
		point p = convex[top] - convex[top-1];
		point q = P[i] - convex[top];
		if (p*q < 0)
		{
			top--;
			i--;
		}
		else
			convex[++top] = P[i];
	}
	N = top;
	convex[N+1] = convex[1];
}

void getSumArea()
{
	int i;
	printf("%d\n",N);
	for (i=1;i<N;i++)
		printf("%d ",convex[i].id);
	printf("%d\n",convex[i].id);
/*	double SumArea = 0;
	for (i=1;i<=N;i++)
		SumArea += convex[i] * convex[i+1];
	SumArea *= 0.5;*/
}

bool cmp2(const point &a,const point &b)
{
	return a * b > 0;
}

void getPair()
{
	int M = 1,i,j,ai,aj;
	double PairArea = 0;
	for (i=1;i<=N;i++)
	{
		A[i] = convex[i];
		if (convex[i].x < convex[i-1].x)
			M = i;
	}
	sort(&A[1],&A[N+1],cmp2);
	for (i=1,j=1;i<=N;i++)
	{
		while (j<M && A[i]*(convex[j]-convex[j+1]) <= 0)
			j++;
		if (j == M)
			break;
		double cur = A[i] * convex[j];
		if (cur > PairArea)
		{
			PairArea = cur;
			ai = A[i].id;
			aj = convex[j].id;
		}
	}
	printf("%d %d\n",ai,aj);
}

void solve()
{
	graham();
	getPair();
	getSumArea();
}

int main()
{
	init();
	solve();
	return 0;
}