codeforces 299 A. Ksusha and Array

1.//cf 299A
//2013-06-05-20.51
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int maxn = 100005;
int a[maxn];
int main()
{
    int n;
    while (scanf("%d", &n) != EOF)
    {
        int m = 0x3f3f3f3f;
        for (int i = 0; i < n; i++)
        {
            scanf("%d", &a[i]);
            m = min(a[i], m);
        }
        int f = 1;
        for (int i = 0; i < n; i++)
        {
            if (a[i]%m != 0)
            {
                f = 0;
                break;
            }
        }
        if (f)
            printf("%d\n", m);
        else
            puts("-1");
    }
    return 0;
}