class Solution {
    public int findGCD(int[] nums) {
        int min=1000, max=1, gcd=1;
        for(int eachNums: nums){
            max=Math.max(max, eachNums);
            min=Math.min(min, eachNums);
        }
        for(int i=1; i<=min; i++){
            if(min%i==0&&max%i==0)
                gcd=i;
        }
        return gcd;
    }
}