#include <bits/stdc++.h>

using namespace std;

int n,half;
vector<int> w;
bool isHalf(int m, int sum,int count) {
	if (sum == half) {
		return true;
	}
	else if (sum > half||count>n/2) {
		return false;
	}
	else {
		int sum2 = sum + w[m];
		for (int i = m + 1; i < n;i++) {
			if (isHalf(i, sum2,count+1)) {
				return true;
			}
		}
		return false;
	}
}
int main() {
	cin >> n;
	w.resize(n);
	half = 0;
	for (int i = 0;i < n;i++) {
		cin >> w[i];
		half += w[i];
	}
	if (half % 2 != 0) {
		cout << "impossible" << endl;
		return 0;
	}
	half /= 2;
	sort(w.begin(), w.end(), greater<int>());
	for (int i = 0;i < n;i++) {
		if (isHalf(i, 0,0)) {
			cout << "possible" << endl;
			return 0;
		}
	}
	cout << "impossible" << endl;
	return 0;
}