import sys
import math
import collections
import bisect


# sys.setrecursionlimit(10000001)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353


def ni(): return int(sys.stdin.buffer.readline())
def ns(): return map(int, sys.stdin.buffer.readline().split())
def na(): return list(map(int, sys.stdin.buffer.readline().split()))
def na1(): return list(map(lambda x: int(x)-1, sys.stdin.buffer.readline().split()))


# ===CODE===
def main():
    n = ni()
    a = na()
    a.sort()
    ra = sorted(a, reverse=True)

    r1 = abs(sum(a[::2]))-abs(sum(a[1::2]))
    r2 = abs(sum(ra[::2]))-abs(sum(ra[1::2]))
    print(max(r1, r2))


if __name__ == '__main__':
    main()