#include using namespace std; #define LOG(...) fprintf(stderr,__VA_ARGS__) //#define LOG(...) #define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i) #define REP(i,n) for(int i=0;i<(int)(n);++i) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(),(a).rend() #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort(ALL(c)) #define RSORT(c) sort(RALL(c)) typedef long long ll; typedef unsigned long long ull; typedef vector vb; typedef vector vi; typedef vector vll; typedef vector vvb; typedef vector vvi; typedef vector vvll; typedef pair pii; typedef pair pll; bool dp[10100+1]; int main() { int n; cin >> n; vi weight(n); REP(i, n) cin >> weight[i]; int sum = accumulate(ALL(weight), 0); if (sum % 2 == 0) { REP(i, n) { int w = weight[i]; for (int j = 10000; j >= 0; j--) { if (dp[j]) { LOG("%d %d\n", j, j+w); dp[j+w] = true; } } } if (dp[sum/2]) { cout << "possible" << endl; return 0; } } cout << "impossible" << endl; }