嗯,就是翡蜀定理。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 1600000
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,ans=0;
inline int gcd(int x,int y){return y?gcd(y,x%y):x;}
int main(){
// freopen("a.in","r",stdin);
n=read();
while(n--){
int x=read();x=abs(x);
ans=gcd(ans,x);
}printf("%d\n",ans);
return 0;
}