import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


/*
  -a -b
  -a -> 0 -> -b
*/

long calc(long a, long b) {
  return (a < 0 && b < 0) ? (-a - b) : abs(a - b);
}

long calc(const(long[]) A) {
  const N = cast(int)(A.length);
  long cost;
  foreach (i; 0 .. N - 1) cost += calc(A[i], A[i + 1]);
  return cost;
}

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto A = new long[N];
      foreach (i; 0 .. N) A[i] = readLong;
      A.sort;
      debug writeln(A);
      
      long ans = long.max;
      chmin(ans, calc(A));
      A = A[0 .. 1] ~ A[2 .. N] ~ A[1];
      chmin(ans, calc(A));
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}