#include #include #include #include #include #include #include #define rep(i, a, b) for (int i = int(a); i < int(b); i++) using namespace std; using ll = long long int; using P = pair; // clang-format off #ifdef _DEBUG_ #define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false) template void PPPPP(T t) { cerr << t; } template void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); } #else #define dump(...) do{ } while(false) #endif template vector make_v(size_t a, T b) { return vector(a, b); } template auto make_v(size_t a, Ts... ts) { return vector(a, make_v(ts...)); } template bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; } template bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; } template void print(T a) { cout << a << '\n'; } template void print(T a, Ts... ts) { cout << a << ' '; print(ts...); } template istream &operator,(istream &in, T &t) { return in >> t; } // clang-format on int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin, n; vector c(n); rep(i, 0, n) { cin, c[i]; } sort(c.rbegin(), c.rend()); ll ans = 1LL << 60; { ll a = 0, b = 0; rep(i, 0, n) { a += c[i]; if (i + 1 < n) { b += c[i + 1]; } i++; } chmin(ans, abs(abs(a) - abs(b))); dump(abs(a) - abs(b)); } { ll a = 0, b = 0; rep(i, 0, n) { a += c[i]; if (2 * i < n - 1) { b += c[n - 1 - i]; } else { break; } } chmin(ans, abs(abs(a) - abs(b))); dump(abs(a) - abs(b)); } print(ans); return 0; }