#include #include using namespace std; using isize = size_t; using i32 = int; using u32 = unsigned int; using i64 = long long; using u64 = unsigned long long; using i128 = __int128_t; using u128 = __uint128_t; using f64 = long double; using p2 = pair; using el = tuple; using mint = atcoder::modint998244353; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(18); _main(); } i64 pow(i64 x, i64 n) { i64 res = 1; i64 t = x; while (n > 0) { if (n & 1) res *= t; t *= t; n >>= 1; } return res; } void _main() { i64 n; cin >> n; vector a(n); for (i64 i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end(), [&](i64 i, i64 j){ if (i >= 0 && j < 0) return false; if (i < 0 && j >= 0) return true; if (i >= 0) return i <= j; return i <= j; }); i64 ans = 1e18; { i64 sum = 0; for (i64 i = 1; i < n; i++) { if (a[i - 1] < 0 && a[i] < 0) { sum -= a[i - 1] + a[i]; } else { sum += abs(a[i - 1] - a[i]); } } ans = min(ans, sum); } { i64 sum = 0; for (i64 i = 1; i < n; i++) { if (a[i] < 0 && a[(i + 1) % n] < 0) { sum -= a[i] + a[(i + 1) % n]; } else { sum += abs(a[i] - a[(i + 1) % n]); } } ans = min(ans, sum); } cout << ans << "\n"; }