#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl

using namespace std;

template<typename S,typename T>auto&operator<<(auto&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(auto&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(auto&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(auto&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(auto&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}};
template<typename S,typename T,typename U>
auto& operator<<(auto& o,TRI<S,T,U>& t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 10005;

vector<ll> prime;
bool is_prime[MAX_N];

void sieve(){
	for(int i=0;i<MAX_N;i++){
		is_prime[i] = true;
	}
	is_prime[0] = is_prime[1] = false;
	for(int i=2;i<MAX_N;i++){
		if(is_prime[i]){
			prime.push_back(i);
			for(int j=2*i;j<MAX_N;j+=i){
				is_prime[j] = false;
			}
		}
	}
}

void prime_factor(ll N, vector<ll>& dev)
{
	for(ll i=2;i*i<=N;i++){
		int cnt = 0;
		while(N%i == 0){
			cnt++;
			N /= i;
		}
		if(cnt){
			dev.pb(i);
		}
	}
	if(N != 1){
		dev.pb(N);
	}
	return;
}

ll a[MAX_N], b[MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    rrep(i,n+1){
        cin >> a[i];
        b[i] = a[i];
    }
    int ch = -1;
    rep(i,n+1){
        if(a[i] != 0){
            ch = i;
            break;
        }
    }
    n -= ch;
    rep(i,n+1){
        a[i] = b[i+ch];
    }
    // sar(a, n+1);
    vl dev;
    prime_factor(abs(a[n]), dev);
    sieve();
    each(p, prime){
        if(p > n+1) break;
        rep(i,n+1){
            b[i] = a[i];
        }
        srep(i,p-1,n+1){
            b[i%(p-1)] += b[i];
        }
        bool ok = true;
        rep(i,min(n+1,p-1)){
            if(abs(b[i])%p){
                ok = false;
                break;
            }
        }
        if(ok){
            if(ch != 0 || abs(a[0]) % p == 0) cout << p << "\n";
        }
    }
    each(p,dev){
        if(p > n+1){
            rep(i,n+1){
                b[i] = a[i];
            }
            srep(i,p-1,n+1){
                b[i%(p-1)] += b[i];
            }
            bool ok = true;
            rep(i,min(n+1,p-1)){
                if(abs(b[i])%p){
                    ok = false;
                    break;
                }
            }
            if(ok){
                if(ch != 0 || abs(a[0]) % p == 0) cout << p << "\n";
            }
        }
    }
    return 0;
}


Measured memory_bytes: 512