//Aideen's Code for P23 {aideen[at]gmail[dot]com}
#include <iostream>
using namespace std;

const int MAX_N = 100*1000 + 13;

int a[MAX_N], r[MAX_N];
int n;

int reverse(int x) {
  int ret = 0;
  while ( x != 0 ) {
    ret = ret*10 + (x%10);
    x /= 10;
  }
  return ret;
}

int main() {
  cin >> n;
  for (int i=0; i<n; i++) {
    cin >> a[i];
    r[i] = reverse(a[i]);
  }

  int maxi = 0;
  for (int i=1; i<n; i++)
    if (r[i] > r[maxi])
      maxi = i;
  cout << a[maxi] << endl;
  return 0;
}