#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long int li;
typedef long double lb;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define repr(i,j,n) for(ll i = j; i >= (n); i--)
#define all(x) (x).begin(),(x).end()
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x&&x<b)
#define out(ans) cout << ans << endl
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<ll,ll>P;
const ll mod=1e9+7;
const int INF = 1000000;
const double PI=3.14159265359;

int main(){

  ll n;cin>>n;
  ll sum=0;
  ll w[n];
  rep(i,0,n){
    cin>>w[i];
    sum+=w[i];
  }
  if(sum%2!=0){
    out("impossible");
    return 0;
  }

  bool dp[10010];
  CLR(dp,false);
  dp[0]=true;

  rep(i,0,n){
    repr(j,sum,w[i])dp[j]=dp[j]|dp[j-w[i]];
  }

  if(dp[sum/2])out("possible");
  else out("impossible");

  return 0;
}