#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

vector<vector<int>> dp;
ll a, b;

int calc(ll a, ll b) {
  if (dp[a][b] != -1) {
    return dp[a][b];
  }
  REP(i, a) {
    if (i != b && calc(i, b) == 0) {
      return dp[a][b] = 1;
    }
  }

  REP(j, b) {
    if (j != a && calc(a, j) == 0) {
      return dp[a][b] = 1;
    }
  }
  return dp[a][b] = 0;
}

bool firstWin(ll a, ll b) {
  if (a > b) {
    swap(a, b);
  }
  // a<=b

  if (a % 2 == 1 && (a == b || a + 1 == b)) {
    return false;
  }

  return true;
}

int main() {
  cin >> a >> b;
  // dp = vector<vector<int>>(a + 1, vector<int>(b + 1, -1));
  // dp[0][0] = 0;
  // FOR(i, 1, a + 1) { dp[i][0] = 1; }
  // FOR(j, 1, b + 1) { dp[0][j] = 1; }
  // REP(i, a + 1) REP(j, b + 1) { cout << calc(i, j) << " \n"[j == b]; }
  bool x = firstWin(a, b);
  cout << (x ? "P" : "Q") << endl;
}