Problem:
Score : 300 points

Problem Statement

There are N monsters, numbered 1, 2, ..., N.

Initially, the health of Monster i is A_i.

Below, a monster with at least 1 health is called alive.

Until there is only one alive monster, the following is repeated:

A random alive monster attacks another random alive monster.

As a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.

Find the minimum possible final health of the last monster alive.

Constraints

All values in input are integers.

2 \leq N \leq 10^5

1 \leq A_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the minimum possible final health of the last monster alive.

Sample Input 1

4
2 10 8 40

Sample Output 1

2

When only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.

Sample Input 2

4
5 13 8 1000000000

Sample Output 2

1

Sample Input 3

3
1000000000 1000000000 1000000000

Sample Output 3

1000000000

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Linq;
using System.Collections.Generic;

namespace Algorithm
{
    class Program
    {
        static void Main(string[] args)
        {
            var n = int.Parse(Console.ReadLine());

            // コスト的にどっちが速いが微妙だけど1回重複を削ってから回す・・・と思ったけどToHashSetが何故か競プロ環境だとCEになる
            // var array = Console.ReadLine().Split().Select(z => int.Parse(z)).ToHashSet<int>().ToArray();
            var array = Console.ReadLine().Split().Select(z => int.Parse(z)).ToArray();
            var min = array.Length == 1 ? array[0] : int.MaxValue;
            var tmp = array[0];

            for (var i = 1; i < array.Length; i++)
            {
                min = Math.Min(Gcd(tmp, array[i]), min);
                if (min == 1) break;
                tmp = min;
            }

            Console.WriteLine(min);
        }

        static int Gcd(int m, int n)
        {
            if (n > m) return Gcd(n, m);
            if (n == 0) return m;
            return Gcd(n, (m % n));
        }
    }
}