#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define aLL(g) (g).begin(),(g).end() #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define F(i,j,k) fill(i[0],i[0]+j*j,k) #define P(p) cout<<(p)< vi; typedef vector vl; typedef vector vd; typedef pair pii; typedef pair pll; typedef long long ll; int dx[] = {0,1,0,-1}; int dy[] = {-1,0,1,0}; int sttoi(std::string str){int ret;std::stringstream ss;ss << str;ss >> ret;return ret;} int table[10001]; int main(){ int n; cin >> n; int sum = 0; table[0] = 0; while(n--){ int t; cin >> t; sum += t; for(int i = 10000;i >= 0;i--){ if(table[i]){ table[i+t] = 1; } } } if(sum%2 == 0 && table[sum]){ P("possible"); }else{ P("impossible"); } }