#include <bits/stdc++.h>
using namespace std;
int solve(int *arr, int n){
if(n <= 3) return 0;
int even[n], odd[n];
int evencnt = 0, oddcnt = 0;
for(int i = 0; i < n; i++){
if(i % 2 == 0){
even[evencnt++] = arr[i];
} else {
odd[oddcnt++] = arr[i];
}
}
if(evencnt < 2 || oddcnt < 2) return 0;
sort(even, even + evencnt); // ascending
sort(odd, odd + oddcnt); // ascending
return even[evencnt - 2] + odd[oddcnt-2]; // second largest even + second smallest odd
}
int main() {
int n;
cin >> n;
int *arr = new int[n];
for(int i = 0; i < n; i++){
cin >> arr[i];
}
cout << solve(arr, n);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgc29sdmUoaW50ICphcnIsIGludCBuKXsKICAgIGlmKG4gPD0gMykgcmV0dXJuIDA7CgogICAgaW50IGV2ZW5bbl0sIG9kZFtuXTsKICAgIGludCBldmVuY250ID0gMCwgb2RkY250ID0gMDsKCiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKXsKICAgICAgICBpZihpICUgMiA9PSAwKXsKICAgICAgICAgICAgZXZlbltldmVuY250KytdID0gYXJyW2ldOwogICAgICAgIH0gZWxzZSB7CiAgICAgICAgICAgIG9kZFtvZGRjbnQrK10gPSBhcnJbaV07CiAgICAgICAgfQogICAgfQoKICAgIGlmKGV2ZW5jbnQgPCAyIHx8IG9kZGNudCA8IDIpIHJldHVybiAwOwoKICAgIHNvcnQoZXZlbiwgZXZlbiArIGV2ZW5jbnQpOyAvLyBhc2NlbmRpbmcKICAgIHNvcnQob2RkLCBvZGQgKyBvZGRjbnQpOyAgICAvLyBhc2NlbmRpbmcKCiAgICByZXR1cm4gZXZlbltldmVuY250IC0gMl0gKyBvZGRbb2RkY250LTJdOyAvLyBzZWNvbmQgbGFyZ2VzdCBldmVuICsgc2Vjb25kIHNtYWxsZXN0IG9kZAp9CgppbnQgbWFpbigpIHsKICAgIGludCBuOwogICAgY2luID4+IG47CiAgICBpbnQgKmFyciA9IG5ldyBpbnRbbl07CiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKXsKICAgICAgICBjaW4gPj4gYXJyW2ldOwogICAgfQoKICAgIGNvdXQgPDwgc29sdmUoYXJyLCBuKTsKICAgIHJldHVybiAwOwp9Cg==