【BZOJ1441】Min【裴蜀定理】

/* Pigonometry */
#include <cstdio>
#include <algorithm>

using namespace std;

int n, ans;

inline int iread() {
int f = 1, x = 0; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
return f * x;
}

inline int intabs(int x) {
return x < 0 ? -x : x;
}

int main() {
n = iread();
for(int i = 1; i <= n; i++) ans = __gcd(ans, intabs(iread()));
printf("%d\n", ans);
return 0;
}