#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

template<int mod>
struct ModInt{
	int x;
	ModInt () : x(0) {}
	ModInt (int64_t x) : x(x >= 0 ? x % mod : (mod - -x % mod) % mod) {}
	ModInt &operator += (const ModInt &p){
		if ((x += p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator -= (const ModInt &p) {
		if ((x += mod - p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator *= (const ModInt &p) {
		x = (int64_t) x * p.x % mod;
		return *this;
	}
	ModInt &operator /= (const ModInt &p) {
		*this *= p.inverse();
		return *this;
	}
	ModInt &operator ^= (int64_t p) {
		ModInt res = 1;
		for (; p; p >>= 1) {
			if (p & 1) res *= *this;
			*this *= *this;
		}
		return *this = res;
	}
	ModInt operator - () const { return ModInt(-x); }
	ModInt operator + (const ModInt &p) const { return ModInt(*this) += p; }
	ModInt operator - (const ModInt &p) const { return ModInt(*this) -= p; }
	ModInt operator * (const ModInt &p) const { return ModInt(*this) *= p; }
	ModInt operator / (const ModInt &p) const { return ModInt(*this) /= p; }
	ModInt operator ^ (int64_t p) const { return ModInt(*this) ^= p; }
	bool operator == (const ModInt &p) const { return x == p.x; }
	bool operator != (const ModInt &p) const { return x != p.x; }
	explicit operator int() const { return x; }
	ModInt &operator = (const int p) { x = p; return *this;}
	ModInt inverse() const {
		int a = x, b = mod, u = 1, v = 0, t;
		while (b > 0) {
			t = a / b;
			a -= t * b;
			std::swap(a, b);
			u -= t * v;
			std::swap(u, v);
		}
		return ModInt(u);
	}
	friend std::ostream & operator << (std::ostream &stream, const ModInt<mod> &p) {
		return stream << p.x;
	}
	friend std::istream & operator >> (std::istream &stream, ModInt<mod> &a) {
		int64_t x;
		stream >> x;
		a = ModInt<mod>(x);
		return stream;
	}
};
typedef ModInt<1000000007> mint;

template<int mod> struct MComb {
	using mint = ModInt<mod>;
	std::vector<mint> fact;
	std::vector<mint> inv;
	MComb (int n) { // O(n + log(mod))
		fact = std::vector<mint>(n + 1, 1);
		for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * mint(i);
		inv.resize(n + 1);
		inv[n] = fact[n] ^ (mod - 2);
		for (int i = n; i--; ) inv[i] = inv[i + 1] * mint(i + 1);
	}
	mint ncr(int n, int r) {
		return fact[n] * inv[r] * inv[n - r];
	}
	mint npr(int n, int r) {
		return fact[n] * inv[n - r];
	}
	mint nhr(int n, int r) {
		assert(n + r - 1 < (int) fact.size());
		return ncr(n + r - 1, r);
	}
};

int gcd(int a, int b) {
	while (a && b) {
		if (a > b) a %= b;
		else b %= a;
	}
	return a + b;
}
int lcm(int a, int b) {
	return a / gcd(a, b) * b;
}

int main() {
	int n = ri();
	int a[n];
	for (auto &i : a) i = ri();
	
	struct Info {
		int max = 0;
		int max2 = 0;
		int max_id = -1;
	};
	std::map<int, Info> map;
	for (int i = 0; i < n; i++) {
		auto add = [&] (int j, int cnt) {
			if (map[j].max <= cnt) map[j].max2 = map[j].max, map[j].max = cnt, map[j].max_id = i;
			else if (map[j].max2 < cnt) map[j].max2 = cnt;
		};
		int t = a[i];
		for (int j = 2; j * j <= t; j++) {
			int cnt = 0;
			while (t % j == 0) t /= j, cnt++;
			if (cnt) add(j, cnt);
		}
		if (t > 1) add(t, 1);
	}
	
	mint tmp[n];
	for (auto &i : tmp) i = 1;
	mint all = 1;
	for (auto i : map) {
		// std::cerr << i.first << " " << i.second.max << " " << i.second.max_id << " " << i.second.max2 << std::endl;
		mint r0 = mint(i.first) ^ i.second.max;
		mint alt = mint(i.first) ^ i.second.max2;
		all *= r0;
		tmp[i.second.max_id] /= r0;
		tmp[i.second.max_id] *= alt;
	}
	for (auto &i : tmp) i *= all;
	
	mint prod = 1;
	for (auto i : a) prod *= i;
	
	for (int i = 0; i < n; i++) {
		// std::cerr << tmp[i] << std::endl;
		std::cout << prod / a[i] - tmp[i] << std::endl;
	}
	
	return 0;
}