#include <bits/stdc++.h>
using namespace std;
vector<int>searchRange(const vector<int> &A, int B) {
    int size = A.size();
    int low =0, high = size-1;
    int mid;
    while(low<=high) {

    mid = low + (high-low)/2;
        if(A[mid]<B) {
        low = mid+1;
    }
    else high = mid - 1;

    }
    int positionOne  = low;
    cout<<positionOne<<endl; 

    low = 0, high = size - 1;

    while(low<=high) {

    mid = low + (high-low)/2;
        if(A[mid]<=B) {
        low = mid+1;
    }
    else high = mid - 1;

    }

    int positionTwo = low;

    if(A[positionOne] != B) return {-1,-1};
    return {A[positionOne],A[positionTwo-1]};

}

int main() {
	// your code goes here
	vector<int>ans = searchRange({1},1);
	cout<<ans[0]<< " "<<ans[1];
	return 0;
}