Find Numbers Occurring More Than N/3 Times

Given a sorted array with length n, find all elements that appear more than n/3 times. The time complexity should be less than O(n). Implement a function to solve this problem and provide examples to verify your code. Example Input 1 [2,2,3]