#include "bits/stdc++.h" using namespace std; using int64 = long long; template using p_que = priority_queue; template using rp_que = priority_queue, greater>; constexpr int INF = (1 << 30) - 1; constexpr int64 INF64 = (1ll << 60) - 1; #define rep(i, N) for(int i=0;i<(int)(N);++i) #define fs first #define sc second #define e_b emplace_back #define m_p make_pair #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() template ostream& operator<<(ostream& os, const pair& p) { return os << "P(" << p.first << ", " << p.second << ")"; } template ostream& operator<<(ostream& os, const vector& v) { os << "["; for (auto& e : v) os << e << ", "; return os << "]"; } template ostream& operator<<(ostream& os, const map& m) { os << "{" << endl; for (auto& e : m) os << "(" << e.first << ", " << e.second << ")" << endl; return os << "}"; } template ostream& operator<<(ostream& os, const set& s) { os << "{" << endl; for (auto& e : s) os << ", " << e << endl; return os << "}"; } 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...)); } int64 gcd(int64 x, int64 y) { if (x == 0 || y == 0) return 0; int64 r; while ((r = y % x) != 0) { y = x; x = r; } return x; } int64 lcm(int64 x, int64 y) { if (x == 0 || y == 0) return 0; return x / gcd(x, y) * y; } int dx[] = { -1, 0, 1, 0 }; int dy[] = { 0, 1, 0, -1 }; void Main(); signed main() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(30); Main(); } /*----------------------------Insert from here!----------------------------*/ /*----------------------------Insert above here----------------------------*/ void Main() { int N; cin >> N; bitset<10001> dp; dp[0] = 1; int sum = 0; rep(i, N) { int w; cin >> w; dp |= dp << w; sum += w; } if (sum % 2 != 0 || !dp[sum / 2]) { cout << "impossible" << endl; } else cout << "possible" << endl; }