#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(15);
	int n;
	cin >> n;
	vector<LL> a(n);
	for (LL& x : a)
		cin >> x;
	sort(ALL(a), greater());
	if (n > 147)
	{
		a.resize(147);
		n = 147;
	}
	LL ans = 0;
	FOR(i1, 0, n)
	{
		FOR(j1, i1 + 1, min(n, i1 + 7))
			FOR(k1, j1 + 1, min(n, i1 + 7))
			{
				if (a[j1] + a[k1] <= a[i1])
					continue;
				FOR(i2, i1 + 1, n)
				{
					if (i2 == j1 || i2 == k1)
						continue;
					FOR(j2, i2 + 1, min(n, i2 + 7))
						FOR(k2, j2 + 1, min(n, i2 + 7))
						{
							if (j2 == j1 || j2 == k1 || k2 == j1 || k2 == k1 || a[j2] + a[k2] <= a[i2])
								continue;
							ans = max(ans, a[i1] + a[j1] + a[k1] + a[i2] + a[j2] + a[k2]);
						}
				}
			}
	}
	cout << ans << "\n";
	return 0;
}