#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define FOR(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros

int memo[301][301];

int grundy(int a, int b) {
    if(memo[a][b] != -1) return memo[a][b];
    if(a == 0 and b == 0) return (memo[a][b] = 0);
    set<int> se;
    if(a > 0) {
        FOR(i, 1, a+1) if(b == 0 or a-i != b) se.insert(grundy(a-i, b));
    }
    if(b > 0) {
        FOR(i, 1, b+1) if(a == 0 or a != b-i) se.insert(grundy(a, b-i));
    }
    // if(a == 3 and b == 0) {
    //     for(int i : se) cout <<i << " ";
    //     cout << endl;
    // }
    int p = 0;
    while(se.count(p)) p++;
    return (memo[a][b] = p);
}

int main(){
    int A, B;
    cin >> A >> B;

    // memset(memo, -1, sizeof(memo));

    // int res = grundy(A, B);
    // cout << (res == 0 ? 'Q' : 'P') << endl;

    // REP(i, A+1) {
    //     REP(j, B+1) cerr << grundy(i, j) << " ";
    //     cerr << endl;
    // }

    if(A > B) swap(A, B);
    if(A % 2 and (A == B or A+1 == B)) {
        cout << "Q\n";
    } 
    else {
        cout << "P\n";
    }
}