int mid=(s+e)>>1;
if(arr[mid]==k)return mid;
if(arr[mid]>arr[s] ){
if(k>=arr[s] && k<=arr[mid])return findinrotated(arr,s,mid-1,k);
else return findinrotated(arr,(mid+1),e,k);
}
if(arr[mid]<arr[e]){
if(k>=arr[mid] && k<=arr[e])return
findinrotated(arr,mid+1,e,k);
else return findinrotated(arr,s,mid-1,k);
}
}
return -1;
}
int main(){
int n;cin>>n;int arr[n];
for(int i=0;i<n;i++)cin>>arr[i];
int k;cin>>k;
cout<<findinrotated(arr,0,n-1,k);
}