#include<stdio.h>

int v[1001],s[2][1001];
int Max(int a,int b)
{
    if(a>=b)
        return a;
    return b;
}


int main()   //Prost :P
{
    freopen("jocul.in","r",stdin);
    freopen("jocul.out","w",stdout);
    int n,i,j,lin=1,sum=0,sol=0,max;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        sum+=v[i];
    }
    max=sum/2;


    for(i=1;i<=n;i++)
    {
        for(j=1;j<=max;j++)
        {
            if(j-v[i]<0)
                s[lin][j]=s[1-lin][j];
            else
                s[lin][j]=Max(s[1-lin][j],s[1-lin][j-v[i]]+v[i]);
        }
        lin=1-lin;
    }
    for(j=0;j<=max;j++)
        if(s[1-lin][j]>sol)
            sol=s[1-lin][j];

    printf("%d %d\n",sol,sum-sol);
    return 0;
}