Big Event in HDU

//#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <stdio.h>
#include <queue>
#include <stack>;
#include <map>
#include <set>
#include <string.h>
#include <vector>
#define ME(x,y) memset(x,y,sizeof(x))
#define SF(n) scanf("%d",&amp;n)
#define rep(i,n) for(int i = 0 ; i < n ; i ++)
#define INF  0x3f3f3f3f
#define mod 1000000007
#define PI acos(-1)
using namespace std;
typedef long long ll ;
int dp[255555] ;
int w[5009];

int main()
{
    int n ;
    while(~scanf("%d",&n) && n > 0)
    {
        int l = 1,sum = 0 ;
        memset(dp,0,sizeof(dp));
        for(int i = 0 ; i < n ; i++)
        {
            int v,num ;
            scanf("%d%d",&v,&num);
            while(num--)
            {
                w[l++] = v ;
                sum += v ;
            }
        }
        for(int i = 1 ; i < l ; i++)
        {
            for(int j = sum/2 ; j >=w[i] ; j--)
            {
                dp[j] = max(dp[j],dp[j-w[i]]+w[i]);
            }
        }
        cout << sum - dp[sum/2] << " " << dp[sum/2] << endl ;

    }

    return 0;
}