class Problem
  attr_accessor *(?a..?z).to_a.map(&:to_sym)
  def initialize
    @n = gets.to_s.to_i
    @m = n / 2
    @a = Array.new(n){ gets.to_s.to_i }.sort
    @top_heavy = a[m+1] - a[m] < a[m] - a[m-1]
  end

  def solve
    ans = 0
    n.times do |i|
      ans += a[i] * weight(i)
      # print "(#{a[i]} * #{weight(i)}) + "
    end
    ans
  end

  def weight(i)
    return weight_even(i) if n.even?
    return weight_odd_top(i) if @top_heavy
    return weight_odd_bottom(i)
  end
    
  def weight_even(i)
    return -2 if i < n / 2 - 1
    return -1 if i == n / 2 - 1
    return 1 if i == n / 2
    return 2
  end
  
  def weight_odd_top(i)
    return -2 if i < m
    return 1 if i == m
    return 1 if i == m + 1
    return 2
  end
  
  def weight_odd_bottom(i)
    return -2 if i < m - 1
    return -1 if i == m - 1
    return -1 if i == m
    return 2
  end

  def show(ans)
    puts ans
  end
end

Problem.new.instance_eval do
  show(solve)
end