#include <iostream>
using namespace std;
typedef long long ll;

const int MAX_N = 300000;
int N;
ll A[MAX_N], res;

ll gcd(ll, ll);

int main() {
    cin >> N;
    for (int i = 0; i < N; i++)
        cin >> A[i];
    if (N == 1)
        cout << 0 << endl;
    else {
        cout << 0 << " ";
        res = abs(A[1] - A[0]);
        for (int i = 1; i < N; i++) {
            if (A[i] != A[0])
                res = gcd(res, abs(A[i] - A[0]));
            cout << res << ((i == N - 1) ? "\n" : " ");
        }
    }
    return 0;
}

ll gcd(ll a, ll b) {
    if (a % b == 0)
        return b;
    return gcd(b, a % b);
}