1 #include <stdio.h>

 2 #include <string.h>

 3 #include <stdlib.h>

 4 #include <iostream>

 5 using namespace std;

 6 int p[250010],f[250010];

 7 int cmp(const void *a,const void *b)

 8 {

 9     return *(int *)b - *(int *)a;//a-b 从小到大排序   b-a 从大到小排序

10 }

11 int main()

12 {

13     int N,i,v,m,sum1,sum2,max,tem;

14     while(cin>>N,N>=0)

15     {

16         memset(p,0,sizeof(p));

17         memset(f,0,sizeof(f));

18         sum1 = sum2 = max = i = 0;

19         while(N--)

20         {

21             scanf("%d %d",&v,&m);

22             while(m--)

23             {

24                 p[i] = v;

25                 sum1 +=v;

26                 i++;

27             }

28         }

29         sum2 = sum1/2;

30         qsort(p,i,sizeof(p[0]),cmp);

31       //  cout<<p[0]<<endl;

32         f[0] = p[0];

33         if(i!=1)

34         {

35             for(int j = 1 ; j < i ; j++)

36             {

37                 f[j] = f[j-1]+p[j];

38                 if(f[j]>sum2)

39                 {

40                     for(int k = 0 ; k < j; k++)

41                     {

42                         tem = f[k] + p[j];

43                         if(tem<=sum2&&tem>f[j])

44                         f[j] = tem;

45                         else continue;

46                     }

47                 }

48                 if(f[j]>sum2)f[j] = p[j];

49                 if(f[j]>max&&f[j]<=sum2)max = f[j];

50                // cout<<f[j]<<endl;

51             }

52         }

53         cout<<sum1-max<<" "<<max<<endl;

54     }

55     return 0;

56 }