Search for the Peak Element

You are given an array of integers where each element is unique. A peak element is an element that is greater than its neighbors. Write a function to find any peak element in the array. If the array contains multiple peaks, return any one of them. The function should use a binary search approach to achieve O(log n) time complexity. Input: - A single line containing space-separated integers, representing the array. Output: - A single integer which is any peak element. Example: Input: 1 2 3 1 Output: 3