// unsolved
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF = 1LL << 60;

int main() {
  int n;
  cin >> n;
  vector<int> w(n + 1);
  for (int i = 1; i <= n; i++) cin >> w[i];
  int sum = 0;
  for (int i = 1; i <= n; i++) sum += w[i];
  if (sum % 2) {
    cout << "impossible" << endl;
    return 0;
  }
  vector<vector<bool>> dp(n + 1, vector<bool>(1e4 + 10, false));
  for (int i = 0; i <= n; i++) dp[i][0] = true;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < 1e4 + 10; j++) {
      if (dp[i - 1][j]) dp[i][j + w[i]] = true;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (dp[i][sum / 2]) {
      cout << "possible" << endl;
      return 0;
    }
  }
  cout << "impossible" << endl;
}