C++ :

#include<bits/stdc++.h>
using namespace std;

int n,i,p,x;
int a[1000100];
int main() {
	cin>>n;
	for(int i = 0;i < n;i++){
		cin>>a[i];
	}
	cin>>x;
	
	if(a[n-1] < x){
		cout<<-1;
		return 0;
	}
	
	//二分在[l,r)之间查找左边界 
	int l = 0,r = n,mid;
	while(l < r){
		mid = l + (r - l) / 2;
		//还要向左侧看
		if(x == a[mid]) r = mid;
		else if(x < a[mid]) r = mid;
		else if(x > a[mid]) l = mid + 1; 
	} 
	
	cout<<l + 1;
}