Problem:
Score : 800 points

Problem 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.

Constraints

0 \leq N \leq 10^4

|a_i| \leq 10^9(0\leq i\leq N)

a_N \neq 0

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
a_N
:
a_0

Output

Print all prime numbers p that divide f(x) for every integer x, in ascending order.

Sample Input 1

2
7
-7
14

Sample Output 1

2
7

2 and 7 divide, for example, f(1)=14 and f(2)=28.

Sample Input 2

3
1
4
1
5

Sample Output 2

There may be no integers that satisfy the condition.

Sample Input 3

0
998244353

Sample Output 3

998244353

Solution in C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
class Program
    {
        static long f (int x, int[] a, int mod)
        {
            long ret = 0;
            long powX = 1;
            for (int i=0; i<a.Length; i++)
            {
                ret += (long)a[i] * powX % mod;
                powX *= (long)x;
            }
            return ret;
        }
        static void Main(string[] args)
        {
            int n = int.Parse(Console.ReadLine());
            int[] a = new int[n+1];
            for (int i=n; i>=0; i--) a[i] = int.Parse(Console.ReadLine());
            List<int> prime = new List<int>();
            if (n == 0)
            {
                for (int i=2; i<10000; i++)
                {
                    bool isPrime = true;
                    foreach (int p in prime)
                    {
                        if (i % p == 0)
                        {
                            isPrime = false;
                            break;
                        }
                    }
                    if (isPrime && a[0] % i == 0)
                    {
                        while (a[0] % i == 0) {a[0] /= i;}
                        prime.Add(i);
                    }
                }
                if (a[0] > 1) prime.Add(a[0]);
                foreach (int p in prime) Console.WriteLine(p);
                return;
            }

            for (int i=2; i<10000; i++)
            {
                bool isPrime = true;
                foreach (int p in prime)
                {
                    if (i % p == 0)
                    {
                        isPrime = false;
                        break;
                    }
                }
                if (isPrime && a[0] % i == 0) prime.Add(i);
            }
            int mod = 1;
            foreach (int p in prime) mod *= p;
            List<int> ans = new List<int>();
            for (int i=1; prime.Count>0; i++)
            {
                long num = f (i, a, mod);
                int pCount = prime.Count;
                for (int j = 0; j < pCount; j++)
                {
                    int p = prime[j];
                    if (num % p != 0)
                    {
                        prime.Remove(p);
                        pCount--;
                        j--;
                    }
                    if (i >= p - 1)
                    {
                        ans.Add(p);
                        prime.Remove(p);
                        pCount--;
                        j--;
                    }
                }
            }
            if (ans.Count > 0) foreach (int p in ans) Console.WriteLine(p);

            
            


            
        }
    }
    //mcs Main.cs
    //mono Main.exe