#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> array;
while(true){
int x; cin >> x;
if(!cin)
break;
array.push_back(x);
}
auto first = find_if(array.begin(), array.end(), [] (int x) { return x&1; });
cout << *max_element(first, array.end(), [] (int largest, int x) {
if(x & 1)
return largest < x;
else
return false;
});
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgICB2ZWN0b3I8aW50PiBhcnJheTsKICAgIHdoaWxlKHRydWUpewogICAgICAgIGludCB4OyBjaW4gPj4geDsKICAgICAgICBpZighY2luKQogICAgICAgICAgICBicmVhazsKICAgICAgICBhcnJheS5wdXNoX2JhY2soeCk7CiAgICB9CiAgICAKICAgIGF1dG8gZmlyc3QgPSBmaW5kX2lmKGFycmF5LmJlZ2luKCksIGFycmF5LmVuZCgpLCBbXSAoaW50IHgpIHsgcmV0dXJuIHgmMTsgfSk7CiAgICBjb3V0IDw8ICptYXhfZWxlbWVudChmaXJzdCwgYXJyYXkuZW5kKCksIFtdIChpbnQgbGFyZ2VzdCwgaW50IHgpIHsKICAgICAgICBpZih4ICYgMSkKICAgICAgICAgICAgcmV0dXJuIGxhcmdlc3QgPCB4OwogICAgICAgIGVsc2UKICAgICAgICAgICAgcmV0dXJuIGZhbHNlOwogICAgfSk7CiAgICByZXR1cm4gMDsKfQ==