最后一个点RE，90pts

#include <iostream>
using namespace std;
long long gcd(long long a,long long b)
{
	if(a%b==0) return b;
	else return gcd(b,a%b);
}
long long a[114514],ans,n;
int main()
{
	cin>>n;ans=0;
	for(long long i=1;i<=n;i++)
	{
		cin>>a[i];
		if(a[i]<0) a[i]=(-a[i]);
		ans=gcd(ans,a[i]);
	}
	cout<<ans;
	
	return 0;
}