#include<bits/stdc++.h>
using namespace std;
const int maxn=100000+10;
const int INF=2*int(1e9)+10;
#define LL long long
int cmd(int a,int b){
	return a>b;
}
int main(){
	int num[6]={1,2,4,7,15,34}; 
	sort(num,num+6);                           //按從小到大排序 
	int pos1=lower_bound(num,num+6,7)-num;    //返回陣列中第一個大於或等於被查數的值 
	int pos2=upper_bound(num,num+6,7)-num;    //返回陣列中第一個大於被查數的值
	cout<<pos1<<" "<<num[pos1]<<endl;
	cout<<pos2<<" "<<num[pos2]<<endl;
	sort(num,num+6,cmd);                      //按從大到小排序
	int pos3=lower_bound(num,num+6,7,greater<int>())-num;  //返回陣列中第一個小於或等於被查數的值 
	int pos4=upper_bound(num,num+6,7,greater<int>())-num;  //返回陣列中第一個小於被查數的值 
	cout<<pos3<<" "<<num[pos3]<<endl;
	cout<<pos4<<" "<<num[pos4]<<endl;
	return 0;	
}