#include<iostream>

 #include<cstring>

 #include<cmath>

 #include<cstdio>

 using namespace std;

 #define for0n for(i=0;i<n;i++)

 #define for1n for(i=1;i<=n;i++)

 const int MAXN=;

 int prime[MAXN+];

 void getPrime()

 {

     memset(prime,,sizeof(prime));

     for(int i=;i<=MAXN;i++)

     {

         if(!prime[i])prime[++prime[]]=i;

         for(int j=;j<=prime[]&&prime[j]<=MAXN/i;j++)

         {

             prime[prime[j]*i]=;

             if(i%prime[j]==) break;

         }

     }

 }

 long long factor[][];

 int fatCnt;

 int getFactors(long long x)

 {

     fatCnt=;

     long long tmp=x;

     for(int i=;prime[i]<=tmp/prime[i];i++)

     {

         factor[fatCnt][]=;

         if(tmp%prime[i]==)

         {

             factor[fatCnt][]=prime[i];

             while(tmp%prime[i]==)

             {

                 factor[fatCnt][]++;

                 tmp/=prime[i];

             }

             fatCnt++;

         }

     }

     if(tmp!=)

     {

         factor[fatCnt][]=tmp;

         factor[fatCnt++][]=;

     }

     return fatCnt;

 }

 int main()

 {

     #ifndef ONLINE_JUDGE

     freopen("1.in","r",stdin);

     #endif

     int t,n,k;

     int i,j;

     getPrime();

     int flag;

     while(cin>>n)

     {

         int maxx=-;

         for0n

         {

             cin>>k;

             getFactors(k);

             if(maxx<factor[fatCnt-][])

             {

                 flag=k;

                 maxx=factor[fatCnt-][];

             }

         }

         cout<<flag<<endl;

     }

 }