def solve(n):
  d = 0
  while not (n&1):
    d += 1
    n //= 2
 
  a = [2]*d
  a[-1] *= n
 
  if d == 1:
  	print("prime")
  	return
 
  for x in range(3, int(n**.5)+1, 2):
    if not (n%x):
      b = a[:]
      b[-1] //= x
      b[-2] *= x
      print("many")
      print(" ".join(map(str, a)))
      print(" ".join(map(str, b)))
      return
 
  print("single")
  print(" ".join(map(str, a)))
 
from sys import stdin
 
for line in stdin:
  print("=== " + line.strip() + " ===")
  solve(int(line))

ZGVmIHNvbHZlKG4pOgogIGQgPSAwCiAgd2hpbGUgbm90IChuJjEpOgogICAgZCArPSAxCiAgICBuIC8vPSAyCgogIGEgPSBbMl0qZAogIGFbLTFdICo9IG4KCiAgaWYgZCA9PSAxOgogIAlwcmludCgicHJpbWUiKQogIAlyZXR1cm4KCiAgZm9yIHggaW4gcmFuZ2UoMywgaW50KG4qKi41KSsxLCAyKToKICAgIGlmIG5vdCAobiV4KToKICAgICAgYiA9IGFbOl0KICAgICAgYlstMV0gLy89IHgKICAgICAgYlstMl0gKj0geAogICAgICBwcmludCgibWFueSIpCiAgICAgIHByaW50KCIgIi5qb2luKG1hcChzdHIsIGEpKSkKICAgICAgcHJpbnQoIiAiLmpvaW4obWFwKHN0ciwgYikpKQogICAgICByZXR1cm4KCiAgcHJpbnQoInNpbmdsZSIpCiAgcHJpbnQoIiAiLmpvaW4obWFwKHN0ciwgYSkpKQoKZnJvbSBzeXMgaW1wb3J0IHN0ZGluCgpmb3IgbGluZSBpbiBzdGRpbjoKICBwcmludCgiPT09ICIgKyBsaW5lLnN0cmlwKCkgKyAiID09PSIpCiAgc29sdmUoaW50KGxpbmUpKQ==

Mgo0CjYKOAoxMAozMAozNAo2MAo2OAoxMjgKNjY2Cjc2MAo0NDQ0NAo3ODc4Nzg3OA==

2
4
6
8
10
30
34
60
68
128
666
760
44444
78787878