#include <stdio.h>
#include <vector>
#include <algorithm>

int x[200010],y[200010];
std::vector<int> V;
int main()
{
	int a;
	scanf("%d",&a);
	for(int i=1;i<=a;i++) scanf("%d",&x[i]);
	for(int i=1;i<=a;i++) y[i] = x[i];
	std::sort(y+1,y+a+1);
	int limit = y[a/2];
	
	if(a%2==1)
	{
		long long int ans = 0;
		V.clear();
		for(int i=1;i<=a;i++) if(x[i]<=limit) V.push_back(i);
		for(int i=0;i<V.size();i++) ans += abs(V[i]-(2*i+2));
		V.clear();
		for(int i=1;i<=a;i++) if(x[i]>limit) V.push_back(i);
		for(int i=0;i<V.size();i++) ans += abs(V[i]-(2*i+1));
		printf("%d %lld",limit,ans/2);
	}
	else
	{
		long long int ans1 = 0;
		V.clear();
		for(int i=1;i<=a;i++) if(x[i]<=limit) V.push_back(i);
		for(int i=0;i<V.size();i++) ans1 += abs(V[i]-(2*i+2));
		V.clear();
		for(int i=1;i<=a;i++) if(x[i]>limit) V.push_back(i);
		for(int i=0;i<V.size();i++) ans1 += abs(V[i]-(2*i+1));
		
		long long int ans2 = 0;
		V.clear();
		for(int i=1;i<=a;i++) if(x[i]<=limit) V.push_back(i);
		for(int i=0;i<V.size();i++) ans2 += abs(V[i]-(2*i+1));
		V.clear();
		for(int i=1;i<=a;i++) if(x[i]>limit) V.push_back(i);
		for(int i=0;i<V.size();i++) ans2 += abs(V[i]-(2*i+2));
		printf("%d %lld",limit,(ans1<ans2?ans1:ans2)/2);
	}
}