#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
static const int MAX_N = 100;
int main() {
	int N;
	cin >> N;
	vector<int>w(N);
	for (int i = 0; i < N; i++) {
		cin >> w[i];
	}
	int all = 0;
	for (int i = 0; i < N; i++) {
		all += w[i];
	}
	int sum = all / 2;
	if (all % 2 != 0) {
		cout << "impossible" << endl;
		return 0;
	}
	vector<vector<int>>dp(N+1, vector<int>(sum+1, false));//i-1番目まで重りを見て、合計jグラムになるかどうか
	for (int i = 0; i < N ; i++) {
		dp[i][0] = true;
	}
	for (int i = 0; i+1 <= N; i++) {
		for (int j =0 ; j<=sum; j++) {
			
			dp[i + 1][j] = dp[i][j] || dp[i + 1][j];
			if (j - w[i + 1] >= 0) {
				dp[i+1][j]=dp[i+1][j]||dp[i][j] || dp[i][j - w[i + 1]];
			}
			
			
		}
	}
	if (dp[N][sum]) {
		cout << "possible" << endl;
	}
	else {
		cout << "impossible" << endl;
	}
	return 0;

}