#pragma region Macros

#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
// using namespace __gnu_cxx;

#define TO_STRING(var) # var
#define pb emplace_back
#define int ll
#define endl '\n'

using ll = long long;
using ld = long double;
const ld PI = acos(-1);
const ld EPS = 1e-10;
const int INF = 1 << 30;
const ll INFL = 1LL << 62;
// const int MOD = 998244353;
const int MOD = 1000000007;

int ceil(int x, int y) {return (x > 0 ? (x + y - 1) / y : x / y);}
int POW(int x, int y) {
    if (y != (int)(y) or y < 0 or x != 0 && x != 1 && y > 64) {cout << "Error" << endl;return 0;}
    if (y == 0) return 1;
    if (y % 2 == 0) return POW(x * x, y / 2);
    return x * POW(x, y - 1);
}

__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
}

#pragma endregion

signed main() {
    int N;
	cin >> N;

	int sum = 0;
	vector<int> A(N);
	for (int i = 0; i < N; i++) {
		cin >> A[i];
		sum += A[i];
	}
	if (sum % 2 != 0) {
		cout << "impossible" << endl;
		return 0;
	}

	vector<vector<int>> dp(N + 1,vector<int>(10101));
	dp[0][0] = true;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= 10000; j++) {
			if (dp[i][j] == false) continue;
			dp[i + 1][j] = true;
			dp[i + 1][j + A[i]] = true;
		}
	}
	cout << (dp[N][sum / 2] ? "possible" : "impossible") << endl;
}