#include <stdio.h>
#define N 30100
int n,best=1;
int a[N],no[N],t[N];
long long timp[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]);  
		a[i]=a[i-1]+no[i];
	}
	
	for(int i=2;i<=n;++i)
		timp[1]+=(i-1)*no[i]+no[i]*t[i];
	
	for(int i=2;i<=n;++i)
		timp[i]=timp[i-1]-no[i]*t[i] + no[i-1]*t[i-1] +2*a[i-1]-a[n];
	
	for(int i=1;i<=n;++i)
		if(timp[i]<timp[best])
			best=i;
	printf("%d %lld\n", best,timp[best]);
	return 0;

}