output_description: Print all prime numbers p that divide f(x) for every integer x, in ascending
  order.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_N
      :
      a_0
attempt: s = input()[::-1]
  a = []
  index = 0
  while index < len(s) - 1:
      if s[index] == "A" and s[index + 1] == "W":
          index += 1
          while index != len(s) and s[index] == "W":
              a.append("C")
              index += 1
          a.append("A")
      else:
          a.append(s[index])
          index += 1
  print("".join(a[::-1]))
  
problem_description: Statement
  
  You are given a polynomial of degree N with integer coefficients:
  f(x)=a_Nx^N+a_{N-1}x^{N-1}+...+a_0. Find all prime numbers p that divide f(x)
  for every integer x.
samples: [{"input": "2\n    7\n    -7\n    14", "output": "2\n    7\n    \n\n2 and 7 divide, for example, f(1)=14 and f(2)=28.\n\n* * *"}, {"input": "3\n    1\n    4\n    1\n    5", "output": "There may be no integers that satisfy the condition.\n\n* * *"}, {"input": "0\n    998244353", "output": "998244353"}]