#include <stdio.h>
#define N 30100
int n,best;
long long max,timp;
int no[N],t[N];
int main()
{
	freopen("bilute.in", "r",stdin);
	freopen("bilute.out", "w",stdout);
	scanf("%d", &n);
	for(int i=1;i<=n;++i)
		scanf("%d%d", &no[i],&t[i]);
	
	for(int i=1;i<=n;++i)
		if( (long long)(no[i]*t[i])>max)
		{
			max=(long long)(no[i]*t[i] );
			best=i;
		}
	for(int i=best+1;i<=n;++i)	
		timp+=(long long)(no[i]*t[i]+no[i]*(i-best) );
	for(int i=1;i<best;++i)
		timp+=(long long)(no[i]*t[i]+no[i]*(best-i) );
	printf("%d %lld\n",best, timp); 
	return 0;

}