Find an element in hidden array

There is an array of length N consisting of non-negative integers. The array is sorted in non-decreasing order. Each number in the array appears exactly K times, except one element, which appears at least once, but less than K times. Your task is to identify that element. This is an interactive problem. You are only given the integer N in the input. Both the array and the value of K are hidden. Y