package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"sort"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)
var wr = bufio.NewWriter(os.Stdout)

func out(x ...interface{}) {
	fmt.Fprintln(wr, x...)
}

func getI() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getF() float64 {
	sc.Scan()
	i, e := strconv.ParseFloat(sc.Text(), 64)
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getI()
	}
	return ret
}

func getS() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

// min for n entry
func nmin(a ...int) int {
	ret := a[0]
	for _, e := range a {
		ret = min(ret, e)
	}
	return ret
}

// max for n entry
func nmax(a ...int) int {
	ret := a[0]
	for _, e := range a {
		ret = max(ret, e)
	}
	return ret
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

func main() {
	defer wr.Flush()
	sc.Split(bufio.ScanWords)
	sc.Buffer([]byte{}, math.MaxInt32)
	// this template is new version.
	// use getI(), getS(), getInts(), getF()
	N := getI()
	c := getInts(N)

	sort.Ints(c)

	ans := [][2]int{}
	a, b := 0, 0
	for i := 0; i < N; i++ {
		if i%2 == 0 {
			a += c[i]
		} else {
			b += c[i]
		}
	}
	ans = append(ans, [2]int{a, b})

	a, b = 0, 0
	for i := N - 1; i >= 0; i-- {
		if i%2 == 0 {
			a += c[i]
		} else {
			b += c[i]
		}
	}
	ans = append(ans, [2]int{a, b})

	a, b = 0, 0
	l, r := 0, N-1
	for i := 0; i < N; i++ {
		if i%2 == 0 {
			a += c[l]
			l++
		} else {
			b += c[r]
			r--
		}
	}
	ans = append(ans, [2]int{a, b})

	a, b = 0, 0
	l, r = 0, N-1
	for i := 0; i < N; i++ {
		if i%2 == 0 {
			a += c[r]
			r--
		} else {
			b += c[l]
			l++
		}
	}
	ans = append(ans, [2]int{a, b})
	sum := int(1e18)
	for i := 0; i < 4; i++ {
		if abs(ans[i][0]) > abs(ans[i][1]) {
			sum = min(sum, abs(ans[i][0])-abs(ans[i][1]))
		}
	}

	out(sum)
}