#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <iomanip>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cstdlib>
#define int long long
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using piii = tuple<int,int,int>;
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x),end(x)
signed main(){
int n;cin >> n;
vector<int> vc;
for(int i{};i < n;i++){
int g;cin >> g;
vc.emplace_back(g);
}
int ans = 0;
int cur = 0;
sort(all(vc),greater<int>());
for(int i{};i < (n+1)/2;i++){
cur += vc[i];
ans = max(ans,cur);
}
cout << ans;
}
