#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];


int main() {
    cin >> n;
    for (int i = 1; i < n + 1; i++) scanf("%d", w + i);
    sort(w + 1, w + n + 1);
    for (int i = 2; i < n + 1; i++) {
        res += w[i] < 0 && w[i - 1] < 0 ? -w[i] - w[i - 1] : abs(w[i] - w[i - 1]);
    }
    if (w[2] < 0) {
        int t = 0;
        for (int i = 2; w[i] < 0; i++) t = min(t, w[i]);
        res = min(res, res + t + abs(w[n]));
    }
    printf("%lld\n", res);
    return 0;
}