#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int single_sorted(vector<int>arr){
int n=arr.size();
int low=0;
int high=n-1;
while(low<high){
int mid=(low+high)/2;
if(mid%2==1){
mid--;
}
if(arr[mid]==arr[mid+1]){
low=mid+2;
}
else{
high=mid;
}
}
return arr[low];
}
int main(){
int n;
cin>>n;
vector<int>arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
}
int ans=single_sorted(arr);
cout<<"Single element in the given array: "<<ans<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBzaW5nbGVfc29ydGVkKHZlY3RvcjxpbnQ+YXJyKXsKICAgIGludCBuPWFyci5zaXplKCk7CiAgICBpbnQgbG93PTA7CiAgICBpbnQgaGlnaD1uLTE7CiAgICB3aGlsZShsb3c8aGlnaCl7CiAgICAgICAgaW50IG1pZD0obG93K2hpZ2gpLzI7CiAgICAgICAgaWYobWlkJTI9PTEpewogICAgICAgICAgICBtaWQtLTsKICAgICAgICB9CgogICAgICAgIGlmKGFyclttaWRdPT1hcnJbbWlkKzFdKXsKICAgICAgICAgICAgbG93PW1pZCsyOwogICAgICAgIH0KICAgICAgICBlbHNlewogICAgICAgICAgICBoaWdoPW1pZDsKICAgICAgICB9CiAgICB9CgogICAgcmV0dXJuIGFycltsb3ddOwp9CgppbnQgbWFpbigpewogICAgaW50IG47CiAgICBjaW4+Pm47CiAgICB2ZWN0b3I8aW50PmFycihuKTsKICAgIGZvcihpbnQgaT0wO2k8bjtpKyspewogICAgICAgIGNpbj4+YXJyW2ldOwogICAgfQogICAgaW50IGFucz1zaW5nbGVfc29ydGVkKGFycik7CiAgICBjb3V0PDwiU2luZ2xlIGVsZW1lbnQgaW4gdGhlIGdpdmVuIGFycmF5OiAiPDxhbnM8PGVuZGw7CiAgICByZXR1cm4gMDsKfQ==