import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

# from functools import lru_cache
#
# @lru_cache(None)
# def win(a,b):
#     if a*b==0:return True
#     for na in range(a):
#         if na==b:continue
#         if not win(na,b):return True
#     for nb in range(b):
#         if nb==a:continue
#         if not win(a,nb):return True
#     return False
#
# for a in range(20):
#     for b in range(a+1):
#         print(a,b,win(a,b))

a,b=LI()
if b>a:a,b=b,a
if b&1 and (a==b or a==b+1):
    print("Q")
else:
    print("P")