#include #include using namespace std; using namespace atcoder; typedef long long ll; typedef long double ld; #define REP(i, n) for (int i = 0; i < (n); ++i) #define REPR(i, n) for (int i = n - 1; i >= 0; --i) #define FOR(i, m, n) for (int i = m; i < n; ++i) #define FORR(i, m, n) for (int i = m; i >= n; --i) #define ALL(v) (v).begin(),(v).end() #define ALLR(v) (v).rbegin(),(v).rend() #define fi first #define se second #define PB push_back #define EB emplace_back template using PQ = priority_queue; template using QP = priority_queue,greater>; templatevoid debug(const T &v,ll h,ll w){for(ll i=0;ivoid debug(const T &v,ll n){for(ll i=0;ivoid debug(const vector&v){debug(v,v.size());} templatevoid debug(const vector>&v){for(auto &vv:v)debug(vv,vv.size());} templatevoid debug(stack st){while(!st.empty()){cout<void debug(queue st){while(!st.empty()){cout<void debug(deque st){while(!st.empty()){cout<void debug(PQ st){while(!st.empty()){cout<void debug(QP st){while(!st.empty()){cout<void debug(const set&v){for(auto z:v)cout<void debug(const multiset&v){for(auto z:v)cout<void debug(const array &a){for(auto z:a)cout<void debug(const map&v){for(auto z:v)cout<<"["<bool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b> n; map,bool> mem; auto f=[&](auto &&f,int a,int b,bool fir=true)->bool{ if(mem.count({a,b})) return (fir?mem[{a,b}]:!mem[{a,b}]); if(a+b==0) return mem[{a,b}]=!fir; bool res; if(fir){ res=false; REP(i,a) res|=f(f,i,b,(i==b&&i?fir:!fir)); REP(i,b) res|=f(f,a,i,(i==a&&i?fir:!fir)); } else{ res=true; REP(i,a) res&=f(f,i,b,(i==b&&i?fir:!fir)); REP(i,b) res&=f(f,a,i,(i==a&&i?fir:!fir)); } cerr << a << " " << b << " " << fir << " " << res << endl; return mem[{a,b}]=(fir?res:!res); }; bool x=f(f,n,n); REP(i,n+1) REP(j,n+1) cerr << i << " " << j << " " << mem[{i,j}] << endl; // REP(i,n+1) FOR(j,i,n+1) cerr << i << " " << j << " " << (f(f,i,j)?'P':'Q') << endl; */ int a,b;cin >> a >> b; if(a>b) swap(a,b); if(a&1&&(b==a||b==a+1)) cout << 'Q' << endl; else cout << 'P' << endl; }