#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;
const int MAXN=3*1000000;

ll gcd(ll x,ll y){
    if(x<y) swap(x,y);
    //x>=y
    return y==0?x:gcd(y,x%y);
}

int main(){
    int N;
    cin>>N;
    vector<ll> A(N);
    for(int i=0;i<N;i++){
        cin>>A[i];
    }
    vector<ll> ans(N+1);
    for(int i=0;i<N;i++){
        ans[i+1]=gcd(ans[i],abs(A[i]-A[0]));
    } 
    for(int i=1;i<=N;i++){
        cout<<ans[i]<<endl;
    }

}