#include <iostream>
#include <string.h>
#include <algorithm>

using namespace std;

int a[5005];
int dp[125025];

bool cmp(int a,int b)
{
    return a > b;
}
int main(void)
{
    int n;
    while (scanf_s("%d", &n))
    {
        if (n < 0)
            break;
        memset(dp, 0, sizeof(dp));
        memset(a, 0, sizeof(a));
        int sum = 0;
        int cnt = 0;
        while (n--)
        {
            int x, y;
            scanf_s("%d%d", &x, &y);
            sum += x * y;
            while (y--)
            {
                a[cnt++] = x;
            }
        }
        sort(a, a + cnt,cmp);
        for (int i = 0; i < cnt; i++)
        {
            for (int j = sum / 2; j >= a[i]; j--)
                dp[j] = max(dp[j], dp[j - a[i]] + a[i]);
        }
        int m = dp[sum / 2];
        int n = sum - m;
        if (m > n)
            cout << m << ‘ ‘ << n << endl;
        else
            cout << n << ‘ ‘ << m << endl;
    }
    return 0;
}