#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cstdlib>

 #include<cmath>

 #define lson l, m, rt<<1

 #define rson m+1, r, rt<<1|1

 #define IO ios::sync_with_stdio(false);cin.tie(0);

 #define INF 1e9

 typedef long long ll;

 using namespace std;

 int n, a[], b[], dp[];

 int main()

 {

     IO;

     while(cin >> n){

         memset(dp, , sizeof(dp)); //不要忘了初始化

         if(n < ) break;

         int sum = ;

         for(int i = ; i < n; i++){

             cin >> a[i] >> b[i];

             sum += a[i]*b[i];

         }

         int half=sum/;

         for(int i = ; i < n; i++){

             for(int k = ; k < b[i]; k++){//多重背包循环是在这里，而不是下面

                 for(int j = half; j >= a[i]; j--){//sum会超时

                     dp[j] = max(dp[j], dp[j-a[i]]+a[i]);

                 }

             }

         }

         cout << sum-dp[half] << " " << dp[half] << endl;

     }

     return ;

 }