#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>

using namespace std;


int n;
vector<int> w;
int dp[101][101];

int rec(int i, int j){
    if(dp[i][j]!=-1){
        return dp[i][j];
    }

    int res;

    if(i==n){
        res = 0;
    }else if(j<w[i]){
        res = rec(i+1, j);
    }else{
        res = max(rec(i+1, j), rec(i+1, j-w[i])+w[i]);
    }

    dp[i][j] = res;
    return res;
}

int main(){

    fill_n((int*)dp, 101*101, -1);

    cin>> n;
    int a, sum = 0;
    for(int i=0; i<n; i++){
        cin>> a;
        w.push_back(a);
        sum += w[i];
    }

    int W;
    if(sum%2==1){
        cout<< "impossible"<< endl;
        return 0;
    }else{
        W = sum/2;
    }

    int ans = rec(0, W);
    if(ans==W){
        cout<< "possible"<< endl;
    }else{
        cout<< "impossible"<< endl;
    }

    return 0;
}