#include <iostream>
#include <algorithm>

using namespace std;

int main() {
    int n;
    cin >> n;

    int arr[n];
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }


    sort(arr, arr + n);

    int sum1 = 0, sum2 = 0;
    if (n % 2 == 0) {
      
        for (int i = n - (n % 2); i < n; ++i) {
            sum1 += arr[i];
        }
        cout <<  sum1 << endl;
    } else {
        // If n is odd, calculate both sums
        for (int i = n - ((n - 1) % 2 + 1); i < n; ++i) {
            sum1 += arr[i];
        }
        for (int i = n - ((n - 1) % 2); i < n; ++i) {
            sum2 += arr[i];
        }
        // Output the largest sum
        cout <<max(sum1, sum2) << endl;
    }

    return 0;
}