#include #include using namespace std; int n, a[1001], s = 0; bool can[150001]; void in() { scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d", &a[i]); s += a[i]; } } void solve() { can[0] = true; for (int i = 0; i < n; i++) for (int j = s / 2; j >= a[i]; j--) can[j] |= can[j - a[i]]; for (int i = s / 2; i >= 0; i--) if (can[i] == true) { printf("%d\n", (s - i) - i); break; } } int main() { in(); solve(); return 0; }