#include<stdio.h>
#define N 30010
int n,v[N],a[N],s[N],p,sol[N],i;
void solv(){
	for(i=1;i<=n;i++)
		sol[1]+=(i-1)*v[i]+v[i]*a[i];
	for(i=1;i<=n;i++)
		sol[i]=sol[i-1]-v[i]*a[i]+v[i-1]*a[i-1]+2*s[i-1]-s[n];
	p=1;
	for(i=1;i<=n;i++)
		if(sol[i]<sol[p])
			p=i;
}
int main(){
	freopen("bilute.in","r",stdin);
	freopen("bilute.out","w",stdout);
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%d %d",v+i,a+i);
		s[i]=s[i-1]+v[i];
	}
	solv();
	printf("%d %d",p,sol[p]);
	fclose(stdin);
	fclose(stdout);
	return 0;
}