paste bin

#include <cstdio>

#include <numeric>
using std::accumulate;

#include <algorithm>
using std::sort;

int main(void)
{
	int *a,N,i,res;
	while(scanf("%d",&N)!=EOF)
	{
		a=new int [N];
		for(i=0;i<N;i++)
			scanf("%d",a+i);

		sort(a,a+N);
		res=accumulate(a,a+N-1,0);
		if(res<a[N-1])
			printf("%.1f\n",(float)res);
		else
			printf("%.1f\n",(float)(res+a[N-1])/2);

		delete [] a;
	}
	return 0;
}