#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
typedef long long ll;
typedef double dd;
#define pb push_back
#define mp make_pair
#define endl "\n"
ll const M = 1000000007;
dd const pi = acos(-1);
ll const inf = 2e18;
ll const N = 200001;
vector<ll> a(5);
vector<char> op = {'+','-','*'};
string s;
bool ok;
ll calculate()
{
	ll i,ans = 0;
	if(s[0] == '+')
		ans = a[0] + a[1];
	else if(s[1] == '-')
		ans = a[0] - a[1];
	else
		ans = a[0]*a[1];
	for(i = 1; i < 4; i++)
	{
		if(s[i] == '+')
			ans = ans + a[i + 1];
		else if(s[i] == '-')
			ans = ans - a[i + 1];
		else
			ans = ans*a[i + 1];
	}
	return ans;
}
void solve(ll i)
{
	if(i == 4)
	{
		if(calculate() == 23)
			ok = true;
		return;
	}
	for(ll j = 0; j < 3; j++)
	{
		s.pb(op[j]);
		solve(i + 1);
		s.pop_back();
	}
}
int main()
{
    fast;
  	ll i,j,t;
  	while(1)
  	{
  		for(i = 0; i < 5; i++)
  			cin >> a[i];
  		for(i = 0; i < 5; i++)
  			if(a[i] != 0)
  				break;
  		if(i == 5)
  			break;
  		s.clear();
  		sort(a.begin(),a.end());
  		ok = false;
  		do { 
        	solve(0);
        	if(ok)
        		break;
        } while (next_permutation(a.begin(),a.end())); 
  		if(ok)
  			cout<<"Possible"<<endl;
  		else
  			cout<<"Impossible"<<endl;
  		
  	}
    return 0;
}