#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using ll = long long;
#define pb emplace_back
#define X first
#define Y second
#define AI(i) begin(i), end(i)
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true);}
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true);}
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l++ << " \n"[l==r]; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

using Real = long double;

const int MAX_N = 300010;
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);

	int n;
	cin >> n;

	constexpr int N = 10000;
	constexpr Real eps = 1e-9;

	vector<Real> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	vector<int> ans(n);

	auto get = [&](int x) -> Real {
		Real diff = 0;
		int g = 0;
		for (int i = 0; i < n; i++) {
			ans[i] = round(a[i] * x / a[0]);
			Real res = a[0] / x * ans[i];
			diff = max(diff, abs(res - a[i]));
			g = gcd(g, ans[i]);
		}
		auto [mn, mx] = minmax_element(ans.begin(), ans.end());
		if (*mn < 1 || *mx > N || g != 1) {
			return 1e9;
		} else {
			return diff;
		}
	};

	Real best = 1e9;
	int x = -1;

	for (int i = 1; i <= N; i++) {
		Real res = get(i);
		if (res < best) {
			best = res;
			x = i;
		}
	}
	get(x);

	for (int i = 0; i < n; i++) {
		cout << ans[i] << '\n';
	}
}