#include<bits/stdc++.h>
//#pragma GCC optimize(3,"Ofast","inline")
using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long  ull;
typedef pair<int,int> pii;
typedef pair<db,db> pdd;
typedef pair<ll,ll> pll;
void init();
void debug();
#define Clear(a)  memset(a,0,sizeof(a))
#define pb(x) push_back(x)
 
#define INF 1e9+10
const int N = 1e3+10;
const int M = 13210;
const int maxn = 3e5 +10;
const ll mod = 1e9+7;

const bool IN_TEST = 1;

int main()
{
    int n;
    cin>>n;
    vector<ll> a(n);
    for (ll& i:a) cin>>i;
    ll sum = accumulate(a.begin(), a.end(), 0);
    ll mx = *max_element(a.begin(), a.end());
    ll res=0;
    if (mx> sum/2ll){
        res = sum - mx;
    }
    else{
        res = sum/2ll;
    }
    cout<<res<<endl;
}