#include<bits/stdc++.h> using namespace std;

int oushu(int x) { if(x%2==0) return x; else return -1; }

int main() { int n;

cin>>n;

int a[1005];

int biggest=-1;

for(int i=1; i<=n; i++)
{
	cin>>a[i];
	
	biggest=max(biggest,oushu(a[i]));

// cout<<"最大值："<<biggest<<endl; }

cout<<biggest;

return 0;

}