#include <cstdio>

using namespace std;

#define N 507

int a[N];

void qsort(int left, int right)
{
	int i = left, j = right, t, temp = a[left];
	if(i >= j)
	{
		return;
	}
	while(i < j)
	{
		while(i < j&&a[j] >= temp)
		{
			j--;
		}
		while(i < j&&a[i] <= temp)
		{
			i++;
		}
		t = a[i];
		a[i] = a[j];
		a[j] = t;
	}
	t = a[left];
	a[left] = a[i];
	a[i] = t;
	qsort(left, i - 1);
	qsort(i + 1, right);
	return;
}
int main()
{
	int n, i;
	double sum = 0, ans;
	
	freopen("stats.in", "r", stdin);
	freopen("stats.out", "w", stdout);
	
	scanf("%d", &n);
	
	for(i = 1; i <= n; i++)
	{
		
		scanf("%d", &a[i]);
		
		sum += a[i];
	}
	sum /= n;
	qsort(1, n);
	if(!(n % 2))
	{
		ans = (double)(a[n / 2] + a[n / 2 + 1]) / 2;
	}
	else
	{
		ans = a[(n + 1) / 2];
	}
	
	printf("%.6lf\n%.6lf", sum, ans);
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}