#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(int i=0;i> H >> S; int n=H.size(),m=S.size(); if((H[n-1]-S[m-1])%2==0) cout << "Possible" << endl; else cout << "Impossible" << endl; return 0; }