#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in ("avioane.in");
ofstream out ("avioane.out");

int main()
{

    int N;
    int Smax=0;
    in>>N;
    int v[N];
    for (int i=0;i<N;++i)
        in>>v[i];

    sort (v, v+N);


    for (int i=0;i<N-1;++i)
    {
        for (int k=i+1;k<N;++k)
        {
            int S=0;
            int j=0;
            for (;j<N&&v[j]<v[i];++j) {}
            for (;j<N&&v[j]<v[k];++j)
            {
                S+=v[i];
            }
            for (;j<N;++j)
            {
                S+=v[k];
            }
            if (S>Smax)
                Smax=S;
        }
    }


    out<<Smax;

    return 0;
}