#include<cstdio>
#include<vector>
#include<algorithm>
#include<iostream>
#include<cassert>
#include<cstring>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
using namespace std;
typedef pair<int,int>pint;
typedef vector<int>vint;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);i++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

bool dp[2][10101];

int main(){
    int N;cin>>N;
    dp[0][0]=true;

    bool b=false;
    rep(i,N){
        int W;cin>>W;
        rep(j,10000){
            dp[!b][j+W]|=dp[b][j];
            dp[!b][abs(j-W)]|=dp[b][j];
            dp[b][j]=false;
        }
        b=!b;
    }

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