import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;
public class Majority_element {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scn = new Scanner(System.in);
int n = scn.nextInt();
int[] arr = new int[n];
for(int i=0; i<n; i++) {
arr[i] = scn.nextInt();
}
solve(arr);
}
static void solve(int[] arr) {
int n = arr.length;
HashMap<Integer, Integer> map = new HashMap<>();
for(int i=0; i<n; i++) {
if(map.containsKey(arr[i])) {
int ov = map.get(arr[i]);
int nv = ov+1;
map.put(arr[i], nv);
}else {
map.put(arr[i], 1);
}
}
boolean flag = false;
ArrayList<Integer> keys = new ArrayList<>(map.keySet());
for(int key:keys) {
if(map.get(key) > (n/3)) {
System.out.print(key +" ");
flag = true;
}
}
if(flag == false) {
System.out.println("No Majority Elements");
}
}
}