#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

const int maxW = 10000+10;

int main()
{
    int n;
    cin>>n;
    VI dp(maxW);
    dp[0] = 1;
    int sum = 0;
    FOR(i,n){
        int w;
        cin>>w;
        sum += w;
        for(int j=maxW;j>=w;j--){
            dp[j] |= dp[j-w];
        }
    }
    if(sum % 2 == 0 && dp[sum/2]) puts("possible");
    else puts("impossible");
    return 0;
}