#include <bits/stdc++.h>
using namespace std;
int findMin(vector<int>& nums) {
int l = 0, r = nums.size() - 1;
while (l < r) {
int mid = l + (r - l) / 2;
if (nums[mid] < nums[r])
r = mid;
else if (nums[mid] > nums[r])
l = mid + 1;
else
r--;
}
return l;
}
int main() {
int n;
cin>>n;
vector<int>arr(n);
for(int i = 0;i < n;i++){
cin>>arr[i];
}
cout<<findMin(arr);
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBmaW5kTWluKHZlY3RvcjxpbnQ+JiBudW1zKSB7CgogICAgaW50IGwgPSAwLCByID0gbnVtcy5zaXplKCkgLSAxOwoKICAgIHdoaWxlIChsIDwgcikgewoKICAgICAgICBpbnQgbWlkID0gbCArIChyIC0gbCkgLyAyOwoKICAgICAgICBpZiAobnVtc1ttaWRdIDwgbnVtc1tyXSkKICAgICAgICAgICAgciA9IG1pZDsKCiAgICAgICAgZWxzZSBpZiAobnVtc1ttaWRdID4gbnVtc1tyXSkKICAgICAgICAgICAgbCA9IG1pZCArIDE7CgogICAgICAgIGVsc2UKICAgICAgICAgICAgci0tOwogICAgfQoKICAgIHJldHVybiBsOwp9CmludCBtYWluKCkgewoJaW50IG47CgljaW4+Pm47Cgl2ZWN0b3I8aW50PmFycihuKTsKCWZvcihpbnQgaSA9IDA7aSA8IG47aSsrKXsKICAgICBjaW4+PmFycltpXTsJCQoJfQoJY291dDw8ZmluZE1pbihhcnIpOwp9