#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define max 1e18
#define for(i,l,r) for(ll i=l;i<r;i++)
#define rep(i,n) for(i,0,n)
#define rfor(i,l,r) for(ll i=r-1;i>=l;i--)
#define rrep(i,n) rfor(i,0,n)
#define all(x) x.begin(),x.end()
#define p pair<ll,ll>
#define f first
#define c second
#define bs(A,x) binary_search(ALL(A),x)
#define lb(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
signed main(){
  ll n,s=0;cin>>n;vector<ll>w(n);rep(i,n)cin>>w[i];rep(i,n)s+=w[i];
  if(s%2){cout<<"impossible"<<endl;return 0;}vector<bool>dp(1e4+1);dp[0]=1;
  rep(i,n)rep(j,1e4+1-w[i])if(dp[j])dp[j+w[i]]=1;
  if(dp[s/2])cout<<"possible"<<endl;else cout<<"impossible"<<endl;
  return 0;
}