#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

#define PQ(T) priority_queue<T>
#define RPQ(T) priority_queue<T,vector<T>,greater<T>>

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }


const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

#include <vector>
using namespace std;

vector<int> primes;
vector<int> smallest_prime_factor;

int sieve(int nmax){
    primes.clear();
    smallest_prime_factor.assign(nmax+1, 0);

    for (int n=2; n<=nmax; ++n) {
        if (!smallest_prime_factor[n]) {
            primes.push_back(n);
            for (int kn=n; kn<=nmax; kn+=n) {
                if (!smallest_prime_factor[kn]) {
                    smallest_prime_factor[kn] = n;
                }
            }
        }
    }
    return primes.size();
}


vi prime_factors(int x){
    set<int> s;
    for (int p: primes){
        while (x%p == 0) {
            s.insert(p);
            x /= p;
        }
    }
    if(x > 1) s.insert(x);
    return vi(ALL(s));
}

bool divisible(vi& a, int p) {
    if (a.back() % p) return false;

    int N = a.size() - 1;
    vector<ll> r(p-1, 0);
    for (int i=0; i<N; ++i) {
        r[(N-i)%(p-1)] += a[i];
    }
    rep(i,p-1) if (r[i] % p) return false;
    return true;
}

void solve0(ll a0) {
    vi ps = prime_factors(a0);
    set<int> ans(ALL(ps));
    for (int p: ans) {
        printf("%d\n", p);
    }
}

void solve(int N, vi& a) {
    if (N == 0) {
        solve0(a[0]);
        return;
    }

    set<int> ans;

    int g = 0;
    rep(i,N+1) g = gcd(g, abs(a[i]));
    if (g > 1) {
        vi ps = prime_factors(g);
        for (int p: ps) ans.insert(p);

        rep(i,N+1) a[i] /= g;
    }

    int a0 = a.back();

    for (int p: primes) {
        if (p > N) break;
        if (divisible(a, p)) ans.insert(p);
    }

    for (int p: ans){
        printf("%d\n", p);
    }
}

int main() {
    sieve(40001);

    int N; scanf("%d", &N);
    vi a(N+1);
    rep(i,N+1) scanf("%d", &a[i]);
    solve(N, a);
    return 0;
}


Measured memory_bytes: 512