/* -*- coding: utf-8 -*-
 *
 * 972.cc:  No.972 選び方のスコア - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

/* global variables */

int as[MAX_N];
ll ass[MAX_N + 1];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) scanf("%d", as + i);
  sort(as, as + n);

  for (int i = 0; i < n; i++) ass[i + 1] = ass[i] + as[i];

  ll maxsum = 0;

  for (int i = 1; i + 1 < n; i++) {
    int ai2 = as[i] * 2;
    int l0 = 0, l1 = min(i + 1, n - i);
    while (l0 + 1 < l1) {
      int l = (l0 + l1) / 2;
      if (as[i - l] + as[n - l] > ai2) l0 = l;
      else l1 = l;
    }

    ll sum =
      (ass[i] - ass[i - l0]) + (ass[n] - ass[n - l0]) - (ll)as[i] * (l0 * 2);
    if (maxsum < sum) maxsum = sum;
    //printf("i=%d, sum=%lld\n", i, sum);
  }

  printf("%lld\n", maxsum);
  return 0;
}