#include<iostream>#include<algorithm>#include<cmath>using namespace std;int bsearch(int data[],int n,int val){int low=0;int high=n-1;while(low<high){int mid=(low+high)/2;if(data[mid]==val)return(mid);else if(data[mid]>val)high=mid-1;else if(data[mid]<val)low=mid+1;}}int main(){int n;cin>>n;int arr[n],temp[n];