#include <iostream>
#include <vector>

using namespace std;

int bin_search(int x, vector <int> vec) {
    int low = 0;
    int high = vec.size();
    while (high - low > 0) {
        int mid = (high + low) / 2;
        if (vec[mid]) > x) {
            high = mid;
        } else {
            low = mid;
        }
    }
}

int main() {
    int n;
    cin >> n;
    vector <int> vec;
    for (int i = 0; i < n; i++) {
        int z;
        cin >> z;
        vec.push_back(z);
    }

    return 0;
}


//for (1..n){
//   cin >> x
//   while(r - l > 0){
//  m = (l + r) / 2
//  if (expeceted < a[m]){
//      l = m
//   } else {
//       r = m
//   }
//  }
//cout << r;
//}


int main() {


    return 0;
}