#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int singleNonDuplicate(vector<int>& nums) {
int n = nums.size();
int low=0;
int high=n-1;
int idx=n-1;
if(n==1){
return nums[0];
}
while(low<high){
int mid = low+(high-low)/2;
if(mid%2!=0){
if(nums[mid]==nums[mid-1]){
low=mid+1;
}
else{
idx=mid;
high=mid;
}
}
else{
if(nums[mid]==nums[mid+1]){
low=mid+1;
}
else{
high=mid;
idx=mid;
}
}
}
return nums[idx];
}
int main() {
// your code goes here
int n;
cin>>n;
vector<int> nums(n);
for(int i=0;i<n;i++){
cin>>nums[i];
}
cout<<singleNonDuplicate(nums);
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBzaW5nbGVOb25EdXBsaWNhdGUodmVjdG9yPGludD4mIG51bXMpIHsKICAgICAgICBpbnQgbiA9IG51bXMuc2l6ZSgpOwogICAgICAgIGludCBsb3c9MDsKICAgICAgICBpbnQgaGlnaD1uLTE7CiAgICAgICAgaW50IGlkeD1uLTE7CgogICAgICAgIGlmKG49PTEpewogICAgICAgICAgICByZXR1cm4gbnVtc1swXTsKICAgICAgICB9CgogICAgICAgIAogICAgICAgIHdoaWxlKGxvdzxoaWdoKXsKICAgICAgICAgIGludCBtaWQgPSBsb3crKGhpZ2gtbG93KS8yOwogICAgICAgICAgaWYobWlkJTIhPTApewogICAgICAgICAgICBpZihudW1zW21pZF09PW51bXNbbWlkLTFdKXsKICAgICAgICAgICAgICAgIGxvdz1taWQrMTsKICAgICAgICAgICAgfQogICAgICAgICAgICBlbHNlewogICAgICAgICAgICAgICAgaWR4PW1pZDsKICAgICAgICAgICAgICAgIGhpZ2g9bWlkOwoKICAgICAgICAgICAgfQogICAgICAgICAgfQogICAgICAgICAgZWxzZXsKICAgICAgICAgICAgICBpZihudW1zW21pZF09PW51bXNbbWlkKzFdKXsKICAgICAgICAgICAgICAgIGxvdz1taWQrMTsKICAgICAgICAgICAgICB9CiAgICAgICAgICAgICAgZWxzZXsKICAgICAgICAgICAgICAgIGhpZ2g9bWlkOwogICAgICAgICAgICAgICAgaWR4PW1pZDsKICAgICAgICAgICAgICB9CiAgICAgICAgICB9CiAgICAgICAgfQoKICAgICAgICByZXR1cm4gbnVtc1tpZHhdOwoKCiAgICB9CiAgICAKCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG47CgljaW4+Pm47Cgl2ZWN0b3I8aW50PiBudW1zKG4pOwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJY2luPj5udW1zW2ldOwoJfQoJCgljb3V0PDxzaW5nbGVOb25EdXBsaWNhdGUobnVtcyk7CgkKCXJldHVybiAwOwp9