#include #include #include #include using namespace std; int main() { int n; cin >> n; vector w(n); for (int i=0;i> w[i]; sort(w.begin(), w.end(), greater()); int t = 0; int th; for (int a : w ) t += a; if (t%2!=0) { cout << "impossible" << endl; return 0; } th = t/2; int ws = w[0]; if (ws==th) {cout << "possible" << endl; return 0;} for (int i=1;ith) {ws = ws - m; break;} else if (ws==th) {cout << "possible" << endl; return 0;} else {ws = ws + w[j];} } } cout << "impossible" << endl; return 0; }