#include <iostream>
#include <queue>

using namespace std;

const int N=8;

int main(){
    int n;
    cin>>n;

    int minim=1001;

    queue<int> q;

    for(int i=0;i<N;i++){
        int a;
        cin>>a;
        q.push(a);
    }

    for(int i=0;i<n-N;i++){
        int a;
        cin>>a;
        q.push(a);
        if( (a*q.front()%2==0) and (a*q.front()<minim) ){
            minim=a*q.front();
        }
        q.pop();
    }

    if(minim==1001){
        cout<<1;
    }
    else{
        cout<<minim;
    }
}