#include <bits/stdc++.h>
#define ALL(v) begin(v), end(v)

using i64 = int64_t;

const int kMaxN = 1E5 + 5;

int n, p;
std::array<i64, kMaxN> a;
i64 ans;
void Eval(int u, int v, int w) {
  if (a[u] >= a[v] + a[w]) return;
  auto Next = [&](int x) {
    ++x;
    while (x == u || x == v || x == w) ++x;
    return x;
  };
  i64 s = a[u] + a[v] + a[w];
  for (int i = p; i + 2 < n; ++i) {
    int j = Next(i), k = Next(j);
    if (j == n || k == n) continue;
    if (a[i] < a[j] + a[k]) {
      ans = std::max(ans, a[i] + a[j] + a[k] + s);
      return;
    }
  }
}

auto main() -> int {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr), std::cout.tie(nullptr);

  std::cin >> n;
  for (int i = 0; i < n; ++i) std::cin >> a[i];
  std::sort(a.data(), a.data() + n, std::greater());
  for (p = 0; p + 2 < n; ++p) {
    if (a[p] < a[p + 1] + a[p + 2]) break;
  }
  for (int i = 0; i + 2 < n; ++i) {
    Eval(i, i + 1, i + 2);
    if (i + 3 < n) Eval(i, i + 1, i + 3);
    if (i + 4 < n) Eval(i, i + 1, i + 4);
    if (i + 3 < n) Eval(i, i + 2, i + 3);
    if (i + 4 < n) Eval(i, i + 2, i + 4);
    if (i + 4 < n) Eval(i, i + 3, i + 4);
  }
  std::cout << ans << '\n';

  return 0;
}