// Slower C++ solution:
#include<iostream>

#include<cstring>

#include<algorithm>

using namespace std;

int f[1000000];

int main(){

//	freopen("j.txt","r",stdin);

	int n;

	cin>>n;

	memset(f,0,sizeof(f));

	for (int i=1;i<=n;i++)

		cin>>f[i];

	sort(f+1,f+1+n);

	int flag=0,max1=0,max2=0;

	for (int i=n-1;i>=1;i--)

		if (f[i]==f[i+1] && !flag){

			max1=f[i];

			flag=1;

		} else if (f[i]==f[i+1] && flag){

			if (f[i]==f[i-1] && f[i]==max1) {

				max2=f[i];

				break;

			}

				else if (f[i]!=max1){

					max2=f[i];

					break;

				} 

		}

    long long s;

	s=(long long)max1*(long long)max2;

	//cout<<max1<<" "<<max2<<endl;

	cout<<s<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.147255079475381x):
/*****************

 *   I<3   C++   *

 *  IWANT ANYAC  *

 * ILOVEPROGRAM! *

 *IT'SINTERESTING*

 * ILOVEPROGRAM! *

 *  INCONTESTS   *

 *   GETSCORE    *

 *    ACCODE     *

 *     LETS      *

 *      GO       *

 *Written by:    *

 *    charlieyan *

 *****************/

#include <assert.h>

#include <ctype.h>

#include <errno.h>

#include <float.h>

#include <fstream>

#include <iomanip>

#include <iostream>

#include <limits>

#include <locale>

#include <math.h>

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <time.h>

#include <wchar.h>

#include <wctype.h>

#include <algorithm>

#include <bitset>

#include <cctype>

#include <cerrno>

#include <clocale>

#include <cmath>

#include <complex>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <deque>

#include <exception>

#include <fstream>

#include <functional>

#include <limits>

#include <map>

#include <iomanip>

#include <ios>

#include <iosfwd>

#include <istream>

#include <ostream>

#include <queue>

#include <set>

#include <sstream>

#include <stack>

#include <stdexcept>

#include <streambuf>

#include <string>

#include <utility>

#include <vector>

#include <cwchar>

#include <cwctype>

#include <complex.h>

#include <fenv.h>

#include <inttypes.h>

#include <stdbool.h>

#include <stdint.h>

#include <tgmath.h>

#include <numeric>

#include <list>

#define LL long long

#define pb push_back

#define pob pop_back

#define mp make_pair

#define FILL(a,v) memset((void*)a,v,sizeof(a))

#define FILL0(a) FILL(a,0)

#define FILL1(a) FILL(a,-1)

#define fillbig(a,m,v) fill((void*)a,(void*)a+m,v)

#define ALL(a) (a).begin(),(a).end()

#define Inf ((int)1e9+(int)1e8+(int)1e7)

#define INF ((long long)1e18+(long long)1e17+(long long)1e16)

#define Mod 1000000007

#define foreach(it,x) for(typeof(x.begin()) it=x.begin();it!=x.end();it++)

#define FOR(i,x) for(int i=0;i<x;i++)

#define RFOR(i,x) for(int i=x-1;i>=0;i--)

#define FFOR(i,a,b) for(int i=a;i<b;i++)

#define FRFOR(i,a,b) for(int i=a-1;i>=b;i--)

#define SZ(a) ((int)(a).size())

#define FI first

#define SE second

#define OVER(a) return puts(a),0

#define fastio ios::sync_with_stdio(0)

#define filei(f) freopen(f,"r",stdin)

#define fileo(f) freopen(f,"w",stdout)

#define eprintf(...) fprintf(stderr,__VA_ARGS__)

#define MASK(a) (1<<(a))

#define MASKX(x,a) ((x)<<(a))

#define BIT(a,b) ((a>>b)&1)

#define cddx(a) priority_queue<a >

#define cxdd(a) priority_queue<a,vector<a >,greater<a > >

using namespace std;

typedef pair<int,int> pii;

typedef unsigned long long UINT;

typedef unsigned int uint;

typedef long long INT;

typedef long double ldouble;

typedef pair<INT,INT> PII;

typedef stringstream sst;

typedef istringstream iss;

typedef vector<int> vint;

typedef vector<INT> VINT;

typedef vector<pii> vpii;

typedef vector<PII> VPII;

typedef priority_queue<int> pqi;

typedef priority_queue<INT> PQI;

typedef priority_queue<pii> pqp;

typedef priority_queue<PII> PQP;

typedef priority_queue<int,vint,greater<int> > xqi;

typedef priority_queue<INT,VINT,greater<INT> > XQI;

typedef priority_queue<pii,vpii,greater<pii> > xqp;

typedef priority_queue<PII,VPII,greater<PII> > XQP;



int n;

int a[100007];

int max1=0,max2=0;

int cnt,lst;



bool CONGDADAOXIAO(int a,int b){return a>b;}

int main()

{

	scanf("%d",&n);

	for(int i=0;i<n;i++)scanf("%d",a+i);

	sort(a,a+n,CONGDADAOXIAO);

	cnt=0;

	lst=-1;

	for(int i=0;i<=n;i++)

	{

		if(cnt==2)

		{

			if(!max1)max1=lst;

			else if(!max2)

				max2=lst;

			cnt=0;

		}

		if(a[i]!=lst)

		{

			lst=a[i];

			cnt=1;

		}

		else cnt++;

	}

	printf("%lld\n",1LL*max1*max2);

	return 0;

}