#include <bits/stdc++.h>
using namespace std;

int main ()
{
      int n, maxim = 0, cumm = 0;
      vector < int >v;
      cin >> n;
      v.resize (n);
      for (int i = 0; i < n; i++)
        cin >> v[i];
      sort (v.begin (), v.end ());
      //if (n>1)
      int left = 0;
      int right = 1;
      cumm = v[0] + v[1];
      while (right <= n-1)
        {
              if (right < n - 1 && v[left] + v[left + 1] >= v[right + 1])
              {

                  right += 1;
                  cumm += v[right];
                  if (cumm > maxim)
                  {
                    maxim = cumm;
                  }
                  else
                  {
                    cumm -= v[left];
                    left += 1;
                  }
              }
              cout << left << ' ' << right << endl;

}
cout << maxim;
}