def sqrt(n):
    lo, hi = 0, n + 1
    while hi - lo > 1:
        m = (hi + lo) // 2
        if m * m <= n:  lo = m
        else:           hi = m
    return lo

s = input()
n = s.count('Q')
if n < len(s):
    print(-1)
else:
    sq = sqrt(n)
    if sq * sq == n:
        print('Q' * sq)
    else:
        print(-1)