#include <stdio.h>

int c[30003],l[30003],d[103],e[103];
long long a[30003],b[30003];
long long s,n,m,p,i,j,k;

int main()
{
    freopen("bilute.in","r",stdin);
    freopen("bilute.out","w",stdout);
    scanf("%lld",&n);
    for (i=1; i<=n; ++i)
    {
        scanf("%d %d",&c[i],&l[i]);
        s+=c[i]*l[i];
    }
    ++d[c[1]];
	++e[c[n]];
    for (i=2, k=n-1; i<=n; ++i, --k)
    {
        a[i]=a[i-1];
		b[k]=b[k+1];
        for (j=1; j<101; ++j) 
		{
			a[i]+=j*d[j];
			b[k]+=j*e[j];
		}
		++e[c[k]];
        ++d[c[i]];
    }
    /*for (i=1; i<=100; ++i) d[i]=0;
    ++d[c[n]];
    for (i=n-1; i>=1; --i)
    {
        b[i]=b[i+1];
        for (j=1; j<101; ++j) b[i]+=j*d[j];
        ++d[c[i]];
    }*/
    m=(long long) 1000000000*1000000000;
    p=0;
    for (i=1; i<=n; ++i)
    {
        if (a[i]+b[i]+s-c[i]*l[i]<m)
        {
            m=(long long)(a[i]+b[i]+s-c[i]*l[i]);
            p=i;
        }
    }
    printf("%lld %lld\n",p,m);
    return 0;
}