#ifdef DEBUG
#define _GLIBCXX_DEBUG
#else
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast,unroll-loops")
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(a) a.begin(), a.end()
#undef long
#define long long long
using namespace std;
using mint = atcoder::modint998244353;
ostream& operator<<(ostream& os, const mint& a) {
	return os << a.val();
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& a) {
	const int n = a.size();
	rep(i, n) os << a[i] << " \n"[i + 1 == n];
	return os;
}
template<typename T>
istream& operator>>(istream& os, const vector<T>& a) {
	for (T& i : a) os >> i;
	return os;
}
void chmin(int& x, int y) {
	if (x > y) x = y;
}
void chmax(int& x, int y) {
	if (x < y) x = y;
}
void solve() {
	string s, t;
	cin >> s >> t;
	bool ans = true;
	ans ^= s[s.length() - 1] % 2 == 0;
	ans ^= t[t.length() - 1] % 2 == 0;
	cout << (ans ? "Possible" : "Impossible") << '\n';
}
int main() {
	// srand((unsigned)time(NULL));
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(40);
	solve();
	return 0;
}