#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for (int i = (int)(n-1); i >= 0; --i)
#define Rep(i,a,b) for (int i = a; i < b; ++i)
#define rRep(i,a,b) for (int i = a; i > b; --i)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define Bit(x,i) (((x)>>(i))&1)
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const double PI = acos(-1);
const int INF = 1e9+2;
const ll LINF = 3e18;

int W[110];
bool dp[110][200100];

int main() {
  int N; cin >> N;
  int sum = 0;
  rep(i, N) {
    cin >> W[i];
    sum += W[i];
  }
  dp[0][0] = true;
  rep(i, N) {
    rep(j, sum+1) {
      if(!dp[i][j]) continue;
      dp[i+1][j] = true;
      dp[i+1][j+W[i]] = true;
      if(j+W[i] == sum-j-W[i]) {
        cout << "possible" << endl;
        return 0;
      }
    }
  }
  cout << "impossible" << endl;
}