#include <bits/stdc++.h>

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
using ll = long long;
constexpr ll MOD = 1000000007;

constexpr int MAX = 200;
int w[MAX];
int dp[MAX + 1][MAX * MAX + 1];

int main()
{
    int n;
    cin >> n;
    int sum = 0;
    rep(i, n)
    {
        cin >> w[i];
        sum += w[i];
    }
    if (sum % 2 == 1) {
        cout << "impossible" << endl;
        return 0;
    }
    sort(w, w + n);

    dp[0][0] = 1;
    rep(i, MAX)
    {
        rep(v, MAX * MAX + 1)
        {
            if (dp[i][v]) {
                dp[i + 1][v] = dp[i][v];
            }
            if (v >= w[i]) {
                if (dp[i][v - w[i]]) {
                    dp[i + 1][v] = dp[i][v - w[i]];
                }
            }
        }
    }
    if (dp[n + 1][sum / 2]) {
        cout << "possible" << endl;
    } else {
        cout << "impossible" << endl;
    }
    return 0;
}