#include #ifdef LOCAL #include #else #define debug(...) void(0) #endif template std::istream& operator>>(std::istream& is, std::vector& v) { for (auto& e : v) { is >> e; } return is; } template std::ostream& operator<<(std::ostream& os, const std::vector& v) { for (std::string_view sep = ""; const auto& e : v) { os << std::exchange(sep, " ") << e; } return os; } template bool chmin(T& x, U&& y) { return y < x and (x = std::forward(y), true); } template bool chmax(T& x, U&& y) { return x < y and (x = std::forward(y), true); } template void mkuni(std::vector& v) { std::ranges::sort(v); auto result = std::ranges::unique(v); v.erase(result.begin(), result.end()); } template int lwb(const std::vector& v, const T& x) { return std::distance(v.begin(), std::ranges::lower_bound(v, x)); } using ll = long long; using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); int N; cin >> N; vector A(N); cin >> A; ranges::sort(A); ll sum = accumulate(A.begin(), A.end(), 0); vector dp(sum / 2 + 1, vector(2, -1)); dp[0][0] = 0; for (int i = 0; i <= sum / 2; i++) { if (dp[i][1] != -1) { int ans = sum - i * 2; if (ans == 0) { cout << -1 << "\n"; } else { cout << ans << "\n"; } return 0; } int x = dp[i][0]; if (x == -1) continue; for (int j = x; j < N; j++) { int nxt = i + A[j]; if (nxt > sum / 2) continue; if (dp[nxt][0] == -1) { dp[nxt][0] = j + 1; } else { dp[nxt][1] = j + 1; } } } cout << -1 << "\n"; return 0; }