#include <bits/stdc++.h>

using LL = long long;

const int N = 1e6 + 7;

LL a[N], ans;
int n;

int main() {

  scanf("%d", &n);
  for(int i = 1; i <= n; ++i)
    scanf("%lld", &a[i]);

  for(int i = 1; i <= n; ++i) {
    ans = std::__gcd(ans, std::abs(a[i] - a[1]));
    printf("%lld\n", ans);
  }
      
  return 0;
}