program align
  implicit none
  integer :: n, a(100000) = 0, b(100000) = 0, i, j
  integer(8) :: x = 0_8, y
  read(*,*) n
  do i = 1, n
    read(*,*) a(i)
  end do
  call quick_sort(a(1:n))
  do j = 1, 2
    if (mod(n,2) == 1) then
      b(1) = a(n/2+1)
      do i = 1, n-1
        if (mod(i,2) == 0) then
          b(i+1) = a(i/2)
        else
          b(i+1) = a(n-i/2)
        end if
      end do
    else
      b(1) = a(n/2)
      do i = 1, n-1
        if (mod(i,2) == 0) then
          b(i+1) = a(i/2)
        else
          b(i+1) = a(n-i/2)
        end if
      end do
    end if
    y = 0_8
    do i = 1, n-1
      y = y+abs(b(i)-b(i+1))
    end do
    x = max(x,y)
    a(1:n) = a(n:1:-1)
  end do
  write(*,'(i0)') x
contains
  recursive subroutine quick_sort(a)
    integer, intent(inout) :: a(:)
    integer :: n, l, r, m
    integer :: p
    n = size(a)
    l = 1
    r = n
    m = (n+1)/2
    p = a(l)+a(m)+a(r)-max(a(l),a(m),a(r))-min(a(l),a(m),a(r))
    do
      do while (a(l) < p)
        l = l+1
      end do
      do while (a(r) > p)
        r = r-1
      end do
      if (l >= r) exit
      a(l) = xor(a(l),a(r))
      a(r) = xor(a(l),a(r))
      a(l) = xor(a(l),a(r))
      l = l+1
      r = r-1
    end do
    if (l-1 > 1) call quick_sort(a(1:l-1))
    if (n > r+1) call quick_sort(a(r+1:n))
  end
end program align