#include <bits/stdc++.h>
using namespace std;

//repetition
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)

//container util
#define all(x) (x).begin(),(x).end()

//typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;

//const value
//const ll MOD = 1e9 + 7;
//const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
//const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};

//conversion
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}


int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI w(n);
  ll sum = 0;
  rep(i,n){
    cin >> w[i];
    sum += w[i];
  }
  if(sum % 2 == 1){
    cout << "impossible" << endl;
    return 0;
  }
  bool dp[n+1][20000];
  memset(dp,false,sizeof(dp));
  dp[0][0] = true;
  rep(i,n){
    rep(j,10001){
      if(dp[i][j]){
        dp[i+1][j+w[i]] = true;
        dp[i+1][j] = true;
      }
    }
  }
  if(dp[n][sum/2]) cout << "possible" << endl;
  else cout << "impossible" << endl;
  return 0;
}