#include <iostream>
#include <algorithm>
using namespace std;
int n;
const int N = 1e5 + 10;
int a[N];
int res;
int main(){
cin>>n;
for(int i = 0;i < n;i++) scanf("%d",&a[i]);
sort(a, a + n);
int t = n / 2;
for(int i = 0;i < t;i++)
res += (a[i + t] - a[i]);
if(2 * t < n){
res += a[2 * t];
cout<<1<<" ";
}else cout<<0<<" ";
res = abs(res);
cout<<res<<endl;
return 0;
}