using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Test()
    {
        var r = new Random();
        var count = 0;
        while (true)
        {
            var n = 4;
            var a = new long[n];
            for (var i = 0; i < n; ++i) a[i] = r.Next(10);
            // 愚直解
            var s1 = All(n, a);
            // 作成解
            var s2 = Gather(n, a);
            if (s1 != s2[^1])
            {
                WriteLine(n);
                // WriteLine(string.Join("\n", map.Select(m => string.Join(" ", m))));
                WriteLine(string.Join(" ", a));
                WriteLine(s1);
                WriteLine(s2[^1]);
                return;
            }
            ++count;
            if (count % 1000 == 0) WriteLine(count);
        }
    }
    static long All(int n, long[] _a)
    {
        var a = _a.ToArray();
        var d = a.Max() - a.Min();
        while (true)
        {
            var max = long.MinValue;
            var maxp = 0;
            var max2 = long.MinValue;
            var max2p = 0;
            for (var i = 0; i < n; ++i)
            {
                if (max < a[i])
                {
                    max2 = max;
                    max2p = maxp;
                    max = a[i];
                    maxp = i;
                }
                else if (max > a[i] && max2 < a[i])
                {
                    max2 = a[i];
                    max2p = i;
                }
            }
            var na = new long[n];
            for (var i = 0; i < n; ++i)
            {
                if (i == maxp || i == max2p) na[i] = a[i];
                else na[i] = a[i] + max - max2;
            }
            var nd = a.Max() - a.Min();
            if (d < nd) break;
            a = na;
            d = nd;
        }
        return d;
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        WriteLine(string.Join("\n", Gather(n, a)));
    }
    static long[] Gather(int n, long[] a)
    {
        var ans = new long[n];
        var gcd = 0L;
        var set = new HashSet<long>{ a[0] };
        for (var i = 1; i < n; ++i)
        {
            if (!set.Contains(a[i]))
            {
                if (set.Count == 1) gcd = Math.Abs(set.First() - a[i]);
                else gcd = GCD(gcd, Math.Abs(set.First() - a[i]));
                set.Add(a[i]);
            }
            ans[i] = gcd;
        }
        return ans;
    }
    static long GCD(long a, long b)
    {
        if (a < b) return GCD(b, a);
        if (a % b == 0) return b;
        return GCD(b, a % b);
    }
}