#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=(int) n;i--)
#define p(s) cout<<(s)<<endl
#define DEBUG(x,y) cout<<#x<<": "<<x<<" , "<<#y<<": "<<y<<endl;
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9;

int a[100010];
int main(){
	int N;
	cin>>N;
	REP(i,0,N){
		cin>>a[i];
	}
	sort(a,a+N);
	int ans=a[N-1];
	REP(i,0,N-1){
		if(ans<a[i]){
			swap(ans,a[i]);
		}
		ans+=a[i]/2;
	}
	p(ans);
	return 0;
}