#include<cstdio>
#include<algorithm>
#define infile "avioane.in"
#define outfile "avioane.out"
#define nMax 100013
#define ll long long

using namespace std;

int v[nMax];
int n;
ll sol;

void read() {
  scanf("%d", &n);
  for(int i = 1; i <= n; ++i)
    scanf("%d", &v[i]);
}

void solve() {
  for(int i = 1; i <= n; ++i)
    for(int j = i+1; j <= n; ++j) {
      ll cur = 0;
      for(int k = 1; k <= n; ++k)
        if(v[k] >= max(v[i], v[j]))
          cur += max(v[i], v[j]);
        else if(v[k] >= min(v[i], v[j]))
          cur += min(v[i], v[j]);
      sol = max(sol, cur);
    }
}

void write() {
  printf("%lld\n", sol);
}

int main() {
  freopen(infile, "r", stdin);
  freopen(outfile, "w", stdout);

  read();
  solve();
  write();

  fclose(stdin);
  fclose(stdout);
  return 0;
}