//第一道题  100%
import java.util.Scanner;

public class Main1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int count = sc.nextInt();
        int[] array = new int[count];

        String s = sc.nextLine();
        System.out.println(s);

        for (int i = 0; i < count; i++) {
            array[i] = sc.nextInt();
        }
        int result = getMaxDivisor(array);
        System.out.println(result);

    }

    public static int getMaxDivisor(int[] array) {
        int minN = getMin(array);
        for (int j = minN; j >= 2; j--) {
            int count = 0;
            for (int i = 0; i < array.length; i++) {
                if (array[i] % j == 0) {
                    count++;
                }
            }
            if (count == array.length) {
                return j;
            }
        }
        return 1;
    }

    public static int getMin(int[] a) {
        if (a.length < 1) {
            return -1;
        }
        int min = a[0];
        for (int i = 0; i < a.length; i++) {
            if (min > a[i]) {
                min = a[i];
            }
        }
        return min;
    }
}

//第二道  100%
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int remain = (240 - m) / 5;// 题目编号的总数要小于等于这个数
        int r = n * (1 + n) / 2;
        while (r > remain) {
            n--;
            r = n * (1 + n) / 2;
        }
        System.out.println(n);

    }
}

//第三道  80%  实在查不出来剩下的20%了
import java.util.Scanner;

public class Main2 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (sc.hasNext()) {

            int count = sc.nextInt();
            int[] array = new int[count];

            for (int i = 0; i < count; i++) {
                array[i] = sc.nextInt();

            }

            // 调用一个函数
            // System.out.println(1);
            int result = f(array);
            System.out.println(result);
        }

    }

    private static int f(int[] array) {
        // TODO Auto-generated method stub
        if (array.length == 0 || array.length == 1) {
            return 0;
        }

        int count = 0;
        int sum = 0;
        for (int i = 0; i < array.length; i++) {
            // System.out.println(array[i]);
            sum = sum + array[i];
        }
        // System.out.println("sum:" + sum);
        if (sum % 2 == 1)
            return count;
        int mid = sum / 2;
        if (sum == mid) {
            count--;
        }
        sum = 0;
        for (int i = 0; i < array.length; i++) {
            sum = sum + array[i];
            if (sum == mid) {
                count++;
            }

        }
        return count;
    }

}