#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////
 
int N, K;
int prime[100010];
ll A[10010];
ll C[10010];
vector<ll> ans;
 
ll gcd(ll a, ll b) {
	if(b == 0) return a;
	else return gcd(b, a % b);
}
 
bool is_prime(ll a) {
	if(a == 1) return false;
	for(ll i = 2; i * i <= a; i++) {
		if(a % i == 0) return false;
	}
	return true;
}
 
void solve() {
	cin >> N;
	rep(i, 0, N + 1) cin >> A[i];
 
	rep(i, 2, 100000 + 1) {
		if(prime[i]) continue;
		for(int j = i * 2; j <= 100000; j += i) {
			prime[j] = 1;
		}
	}
 
	ll g = abs(A[0]);
	rep(i, 0, N + 1) {
		g = gcd(g, abs(A[i]));
	}
	for(ll i = 2; i * i <= g; i++) {
		if(g % i == 0) {
			if(!prime[i]) ans.pb(i);
			if(is_prime(g / i)) ans.pb(g / i);
		}
	}
	if(is_prime(g)) ans.pb(g);
 
	for(int i = 2; i <= N + 10; i++) {
		if(prime[i]) continue;
		bool found = false;
		vector<int> ord;
		rep(j, 0, i) ord.pb(j);
		shuffle(all(ord), rng);
		for(int j = 0; j < min(i, 100); j++) {
			ll coef = 1;
			ll sum = 0;
			rep(k, 0, N + 1) {
				sum += coef * A[N - k];
				sum %= i;
				coef *= ord[j]; coef %= i;
			}
			if(sum != 0) {
				found = true; break;
			}
		}
		if(!found) ans.pb(i);
	}
	sort(all(ans));
	ans.erase(unique(all(ans)), ans.end());
	debug(sz(ans));
	rep(i, 0, sz(ans)) {
		cout << ans[i] << "\n";
	}
}
 
uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}
 
int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}
 


Measured memory_bytes: 896