#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#define maxn 500005

using namespace std;

int dp[maxn],v[maxn],w[maxn];

int main()

{

	int i,j,k,n;

	while(scanf("%d",&n)!=EOF&&n>0)

	{

		int sum=0;

		memset(dp,0,sizeof(dp));

		for(i=1;i<=n;i++)

		{

			scanf("%d %d",&v[i],&w[i]);

			sum+=v[i]*w[i];

		}

		for(i=1;i<=n;i++)

			for(j=1;j<=w[i];j++)

				for(k=sum/2;k>=v[i];k--)

					dp[k]=max(dp[k],dp[k-v[i]]+v[i]);

		printf("%d %d\n",sum-dp[sum/2],dp[sum/2]);

	}

}