#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
#include <set>

template <class T, class U>
inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return true;
  }
  return false;
}

template <class T, class U>
inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return true;
  }
  return false;
}

// [l, r) from l to r
struct range {
  struct itr {
    int i;
    constexpr itr(int i_): i(i_) { }
    constexpr void operator ++ () { ++i; }
    constexpr int operator * () const { return i; }
    constexpr bool operator != (itr x) const { return i != x.i; }
  };
  const itr l, r;
  constexpr range(int l_, int r_): l(l_), r(std::max(l_, r_)) { }
  constexpr itr begin() const { return l; }
  constexpr itr end() const { return r; }
};

// [l, r) from r to l
struct revrange {
  struct itr {
    int i;
    constexpr itr(int i_): i(i_) { }
    constexpr void operator ++ () { --i; }
    constexpr int operator * () const { return i; }
    constexpr bool operator != (itr x) const { return i != x.i; }
  };
  const itr l, r;
  constexpr revrange(int l_, int r_): l(l_ - 1), r(std::max(l_, r_) - 1) { }
  constexpr itr begin() const { return r; }
  constexpr itr end() const { return l; }
};


template <class T>
class runtime_modulo_int {
public:
  static int mod() { return T::value; }
private:
  long long value;
  void normalize() {
    value %= mod();
    if (value < 0) value += mod();
  }
public:
  runtime_modulo_int(long long value_ = 0): value(value_) { normalize(); }
  runtime_modulo_int operator - () const { return runtime_modulo_int(mod() - value); }
  runtime_modulo_int operator ~ () const { return power(mod() - 2); }
  long long operator () () const { return value; }
  runtime_modulo_int operator + (const runtime_modulo_int& rhs) const { return runtime_modulo_int(*this) += rhs; }
  runtime_modulo_int& operator += (const runtime_modulo_int& rhs) {
    if ((value += rhs.value) >= mod()) value -= mod();
    return (*this);
  }
  runtime_modulo_int operator - (const runtime_modulo_int& rhs) const { return runtime_modulo_int(*this) -= rhs; }
  runtime_modulo_int& operator -= (const runtime_modulo_int& rhs) {
    if ((value += mod() - rhs.value) >= mod()) value -= mod();
    return (*this);
  }
  runtime_modulo_int operator * (const runtime_modulo_int& rhs) const { return runtime_modulo_int(*this) *= rhs; }
  runtime_modulo_int& operator *= (const runtime_modulo_int& rhs) {
    (value *= rhs.value) %= mod();
    return (*this);
  }
  runtime_modulo_int operator / (const runtime_modulo_int& rhs) const { return runtime_modulo_int(*this) /= rhs; }
  runtime_modulo_int& operator /= (const runtime_modulo_int& rhs) {
    return (*this) *= ~rhs;
  }
  runtime_modulo_int power (unsigned long long pow) const {
    runtime_modulo_int result(1), mult(*this);
    while (pow > 0) {
      if (pow & 1) result *= mult;
      mult *= mult;
      pow >>= 1;
    }
    return result;
  }
  friend std::istream& operator >> (std::istream& stream, runtime_modulo_int& lhs) {
    stream >> lhs.value;
    lhs.normalize();
    return stream;
  }
  friend std::ostream& operator << (std::ostream& stream, const runtime_modulo_int& rhs) {
    return stream << rhs.value;
  }
};

struct runtime_mod { static int value; };
int runtime_mod::value;
int &mod = runtime_mod::value;
using modint = runtime_modulo_int<runtime_mod>;

bool is_prime(int x) {
  if (x <= 1) {
    return false;
  }
  for (int i = 2; i * i <= x; ++i) {
    if (x % i == 0) {
      return false;
    }
  }
  return true;
}

int gcd(int x, int y) {
  if (x < 0) x = -x;
  if (y < 0) y = -y;
  if (x == 0) return y;
  if (y == 0) return x;
  int r;
  while ((r = x % y) != 0) {
    x = y;
    y = r;
  }
  return y;
}

int main() {
  int N;
  std::cin >> N;
  std::vector<int> A(N + 1);
  for (int &x: A) {
    std::cin >> x;
  }
  std::reverse(A.begin(), A.end());
  auto check = [&](int candidate) {
    if (!is_prime(candidate)) {
      return false;
    }
    mod = candidate;
    if (A[0] % mod != 0) {
      return false;
    }
    std::vector<modint> poly(std::min(N + 1, mod - 1));
    for (int i: range(0, N + 1)) {
      poly[i % (mod - 1)] += A[i];
    }
    for (auto x: poly) {
      if (x() != 0) {
        return false;
      }
    }
    return true;
  };
  std::set<int> ans;
  for (int i: range(2, N + 1)) {
    if (check(i)) {
      ans.insert(i);
    }
  }
  int cur = 0;
  for (int x: A) {
    cur = gcd(cur, x);
  }
  for (int i = 1; i * i <= cur; ++i) {
    if (cur % i == 0) {
      if (check(i)) {
        ans.insert(i);
      }
      if (check(cur / i)) {
        ans.insert(cur / i);
      }
    }
  }
  for (int x: ans) {
    std::cout << x << '\n';
  }
  return 0;
}


Measured memory_bytes: 384