hdu 2710

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()) {
			int n=sc.nextInt();
			int[] input = new int[n];
			int[] in=new int[n];
			for(int i=0;i<n;i++) {
				input[i]=sc.nextInt();
				in[i]=input[i];
			}
			System.out.println(in[maxFactor(input,n)]);
		}
		sc.close();
	}
	
	public static int maxFactor(int[] input,int n) {
		int[] max = new int[n];
		int m=0,index=0;
		for(int i=0;i<n;i++) {
			if(isPriem(input[i])) {
				max[i]=input[i];
			}
			else
				for(int j=2;j<=Math.sqrt(input[i]);j++) {
					if(isPriem(input[i]/j)&&input[i]%j==0) {
						max[i]=input[i]/j;
						break;
					}
				}
			}
		for(int i=0;i<n;i++)
			if(m<max[i]) {
				m=max[i];
				index=i;
			}
		return index;
	}
	
	public static boolean isPriem(int a) {
		for(int i=2;i<=Math.sqrt(a);i++) {
			if(a%i==0)
				return false;
		}
		return true;
	}
}