2

#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;

int main(){
    int n;
    cin>>n;
    vector<int>data(1000);
    vector<int>hash(1000);
    for(int i=0;i<n;i++){
        cin>>data[i];
        hash[data[i]]++;
    }
    sort(data.begin(),data.end());
    vector<int>res;
    int better=data[n-1];
    while(better>0){
        if(hash[better]==2){
            res.push_back(better);
        }
        better--;
        if(res.size()==2){break;}
    }
    int ress=res[0]*res[1];
    cout<<ress<<endl;
    
    return 0;
}