#include <stdio.h>

const int Mod = 1000000007;

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

long long pow_mod(long long n, int k)
{
	long long N, ans = 1;
	for (N = n; k > 0; k >>= 1, N = N * N % Mod) if (k & 1) ans = ans * N % Mod;
	return ans;
}

int main()
{
	int i, N, A[100001];
	scanf("%d", &N);
	for (i = 1; i <= N; i++) scanf("%d", &(A[i]));
	
	int h, j, k, l, m, count[1000001] = {};
	long long total[2] = {1, 1}, tmp;
	for (i = 1; i <= N; i++) {
		total[0] = total[0] * A[i] % Mod;
		if (A[i] == 1) continue;
		for (j = 2, m = A[i]; j * j <= m; j++) {
			if (m % j != 0) continue;
			for (k = 0, l = j; m % j == 0; k++, l *= j) {
				count[l]++;
				m /= j;
			}
		}
		if (m > 1) count[m]++;
	}
	
	char flag[1000001] = {};
	for (i = 2; i <= 1000000; i++) {
		if (flag[i] != 0) continue;
		for (j = i * 2; j <= 1000000; j += i) flag[j] = 1;
		for (tmp = i; tmp <= 1000000; tmp *= i) total[1] = total[1] * div_mod(1, pow_mod(i, (count[tmp] - 1)), Mod) % Mod;
	}
	
	for (i = 1; i <= N; i++) {
		for (j = 2, tmp = 1, m = A[i]; j * j <= m; j++) {
			if (m % j != 0) continue;
			for (k = 0, l = j; m % j == 0; k++, l *= j) {
				if (count[l] > 1) tmp *= j;
				m /= j;
			}
		}
		if (m > 1 && count[m] > 1) tmp *= m;
		printf("%lld\n", div_mod(total[0], A[i], Mod) * (1 - total[1] * tmp % Mod + Mod) % Mod);
	}
	fflush(stdout);
	return 0;
}