This document requests a Java implementation of a stack-like data structure that can PUSH elements and POP the most frequent element, with ties broken by proximity to the top. If elements are tied for most frequent, the one closer to the top is removed and returned.