#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
using namespace std;

const int N = 2e5 + 5, inf = 1e9;
const double e = 1e-7;
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;

void solve(){
    int n;
    cin >> n;
    vector<double> a(n);

    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    
    for(int i = 1; i <= 10000; i++){
        double d = (double)(i) / a[0];
        bool b = 1;
        for(int j = 1; j < n; j++){
            int tmp = a[j] * d;
            if(a[j] * d - tmp > e && ((double)(tmp) + 1 - a[j] * d) > e){
                b = 0;
                break;
            }
        }
        if(b == 1){
            cout << i << '\n';
            for(int j = 1; j < n; j++){
                int tmp = a[j] * d;
                if(double(tmp + 1) - a[j] * d <= e) 
                    cout << tmp + 1 << '\n';
                else{
                    cout << tmp << '\n';
                }
            }
            return;
        }
    }
    return;
}

int main(){
    int t = 1;
    while(t--){
        solve();
    }
    return 0;
}