#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cstdarg>

using namespace std;

const int MAX_W = 23000, MAX_V = 55, MAX_ORG = 110;

int _max(int a, int b)

{

	return b == 0 ? a : max(a, b);

}

int Dp(int totV, int totObj, int totW, int *objW)

{

	static int DP[MAX_W][MAX_V];

	memset(DP, 0xcf, sizeof(DP));

	DP[0][0] = 0;

	for (int obj = 1; obj <= totObj; obj++)

		for (int w = totW; w >= objW[obj]; w--)

			for (int v = totV; v >= 1; v--)

				DP[w][v] = _max(DP[w][v], DP[w - objW[obj]][v - 1] + objW[obj]);

	int ans = 0;

	for (int i = 0; i <= totW; i++)

		ans = max(ans, DP[i][totV]);

	return ans;

}

int main()

{

#ifdef _DEBUG

	freopen("c:\\noi\\source\\input.txt", "r", stdin);

#endif

	int n, sum = 0, ws[MAX_ORG];

	memset(ws, 0, sizeof(ws));

	scanf("%d", &n);

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

	{

		scanf("%d", i + ws);

		sum += ws[i];

	}

	int lighter = Dp(n / 2, n, (sum + 1) / 2, ws);

	if ((n / 2) * 2 != n)

		lighter = max(lighter, Dp(n / 2 + 1, n, (sum + 1) / 2, ws));

	int weighter = sum - lighter;

	if (lighter > weighter)

		swap(lighter, weighter);

	printf("%d %d\n", lighter, weighter);

	return 0;

}