#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 1e5 + 5;
int arr[N];
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", &arr[i]);
sort(arr, arr+n);
int res = 0;
for (int i = 0; i < n; ++i)
{
if (i >= n/2) res += arr[i];
else res -= arr[i];
}
printf("%d %d", n&1, res);
return 0;
}