#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int a[1000];

void solve() {
	int n;
	cin >> n;
	vector<int> a(n + 1);
	for (int i = 1 ; i <= n ; i++) {
		cin >> a[i];
	}

	sort(a.begin() + 1, a.end());

	ll mi = 0, sum = 0;
	for (int i = n ; i >= n - 1; i--) {
		sum += a[i];
		if (sum >= mi)
			mi = sum;
		else
			break;
	}
	cout << mi << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	//cin>>t;
	while (t--)
		solve();
	return 0;
}