#include<iostream>
#include<algorithm>
using namespace std;
using lint=int64_t;

int main()
{
	int N;
	int W[110];
	int sum=0;

	cin >> N;
	for(int i=1;i<=N;i++)
	{
		cin >> W[i];
		sum+=W[i];
	}

	if(sum%2==1)
	{
		cout << "impossible" << endl;
		return 0;
	}

	sum/=2;
	int dp[110][10010]={};
	dp[0][0]=true;
	for(int i=1;i<=N;i++)
	{
		for(int j=0;j<=sum;j++)
		{
			dp[i][j]|=dp[i-1][j];
			if(j-W[i]>=0)
				dp[i][j]|=dp[i-1][j-W[i]];
		}
	}

	if(dp[N][sum])
		cout << "possible";
	else
		cout << "impossible";
	cout << endl;
	return 0;
}