#include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>

int main() {
	int n;
	std::cin >> n;

	std::vector<int> weight(n);
	for (int i = 0; i < n; i++) {
		std::cin >> weight[i];
	}

	int sum = std::accumulate(weight.begin(), weight.end(), 0);

	// 重さが奇数では天秤が平らになることはない
	if (sum % 2 == 1) {
		std::cout << "impossible" << std::endl;
		return 0;
	}

	sum /= 2; // この重さを作れたら勝ち

	std::vector<int> dp(1, 0);

	for (int i = 0; i < weight.size(); i++) {
		for (int j = dp.size() - 1; j >= 0; j--) {
			if (dp[j] + weight[i] == sum) {
				std::cout << "possible" << std::endl;
				return 0;
			}
			if (dp[j] + weight[i] > sum) continue;
			dp.push_back(dp[j] + weight[i]);
		}
		dp.erase(std::unique(dp.begin(), dp.end()), dp.end());
	}

	std::cout << "impossible" << std::endl;


	return 0;
}