#include <bits/stdc++.h>
using namespace std;
 
int main() {
	int n;
	cin >> n;
 
	vector<int> arr;
 
	for(int i=0; i<n; i++) {
		int num;
		cin >> num;
 
		arr.push_back(num);
	}
 
	sort(arr.begin(), arr.end());
 
	auto mg = upper_bound(arr.begin(), arr.end(), 35);
 
	auto idx = mg - arr.begin(); // returns the index of number slightly greater then 100 in array
	cout << "Index: " << idx << endl;
 
	int lb = arr[idx]; // Upper bound number
 
	cout << "Nearest number: " << lb << endl;
 
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOwoJY2luID4+IG47CgkKCXZlY3RvcjxpbnQ+IGFycjsKCQoJZm9yKGludCBpPTA7IGk8bjsgaSsrKSB7CgkJaW50IG51bTsKCQljaW4gPj4gbnVtOwoJCQoJCWFyci5wdXNoX2JhY2sobnVtKTsKCX0KCQoJc29ydChhcnIuYmVnaW4oKSwgYXJyLmVuZCgpKTsKCQoJYXV0byBtZyA9IHVwcGVyX2JvdW5kKGFyci5iZWdpbigpLCBhcnIuZW5kKCksIDM1KTsKCglhdXRvIGlkeCA9IG1nIC0gYXJyLmJlZ2luKCk7IC8vIHJldHVybnMgdGhlIGluZGV4IG9mIG51bWJlciBzbGlnaHRseSBncmVhdGVyIHRoZW4gMTAwIGluIGFycmF5Cgljb3V0IDw8ICJJbmRleDogIiA8PCBpZHggPDwgZW5kbDsKCQoJaW50IGxiID0gYXJyW2lkeF07IC8vIFVwcGVyIGJvdW5kIG51bWJlcgoJCgljb3V0IDw8ICJOZWFyZXN0IG51bWJlcjogIiA8PCBsYiA8PCBlbmRsOwoKCXJldHVybiAwOwp9

NQoxMAoyMAozMAo0MAo1MA==

5
10
20
30
40
50