#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <queue>
#include <cassert>
#include <unordered_map>
#define rf freopen("in.in", "r", stdin)
#define wf freopen("out.out", "w", stdout)
#define rep(i, s, n) for(int i=int(s); i<=int(n); ++i)
using namespace std;
const int mx = 1e5 + 10, mod = 1e9+7;

int main() {
	//rf;// wf;
	ios::sync_with_stdio(0);

	int num[4];
	int perm[] = {0, 1, 2, 3};

	rep(i, 0, 3) {
		cin >> num[i];
	}

	while(next_permutation(perm, perm + 4)) {
		if(num[perm[0]] * num[perm[3]] == num[perm[1]] * num[perm[2]]) {
			cout << "Possible" << endl;
			return 0;
		}
	}

	cout << "Impossible" << endl;
	return 0;
}