Given an integer array of size n, find all elements that appear more than ⌊n/3⌋ times. Return the result in any order.

Example 1:

Input: 3 2 3
Output: 3

Example 2:

Input: 1 1 1 3 3 2 2 2
Output: 1 2

Input format: Space-separated integers.

Output format: Space-separated majority elements in ascending order (or single value).