#include typedef long long ll; const int INF = 1e9,MOD = 1e9+7,ohara = 1e6; const ll LINF = 1e18; using namespace std; #define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++) #define rrep(i,a,b) for(ll i=(a);i<(b);i++) #define rrrep(i,a,b) for(ll i=(a);i>=(b);i--) #define all(v) (v).begin(), (v).end() #define pb(q) push_back(q) #define Size(n) (n).size() #define Cout(x) cout<<(x)<>a>>b>>c>>d; if(d==10)Cout("Impossible"); else{ ll konbo=0; while(1){ if(b==0)break; b--; konbo++; pos=konbo/100; if(konbo%100==0)pos--; cnt=1; rep(i,pos)cnt*=2; ans+=50*cnt; } while(1){ if(a==0)break; a--; konbo++; pos=konbo/100; if(konbo%100==0)pos--; cnt=1; rep(i,pos)cnt*=2; ans+=100*cnt; } Cout("Possible"); Cout(ans); } return 0; }