#include
using namespace std;
const int N = 1e6 + 10;
int n;
int a[N];
bool binarySearch(int a[], int x, int left, int right, int &i, int &j) {
cin >> x;
while (left < right) {
int mid = left + right >> 1;
if (a[mid] >= x) right = mid;
else left = mid + 1;
}
if (a[left] != x) {
i = left - 1;
j = left;
return false;
}
else {
i = j = left;
return true;
}
}
int main() {
cin >> n;
for (int i = 0;i < n;i++) cin >> a[i];
int x, i, j;
bool binarySearch(a, x, 0, n - 1, i, j);
cout << "("<< i <<","<< j << ")";
return 0;
}