How to find number in a sorted array whose absolute difference from given 'X' is maximum in less than O(N) time?

Question

So Let\'s take an example like {8,8,8,8,9,9,9,9,10,12} and given X = 4. so I want to return 12 as its difference from 4 (12-4 = 8) is maximum. I can only think of a linear w