#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int> numbers(n);
for(auto& number: numbers){
cin>>number;
}
unordered_map<int,int> hashArray;
for(int i=0; i<n; i++){
hashArray[numbers[i]]++;
}
int maxFreq = INT_MIN, maxNumber = -1;
int minFreq = INT_MAX, minNumber = -1;
for(auto it = hashArray.begin(); it != hashArray.end(); it++){
int count = it->second;
int number = it->first;
if(count > maxFreq){
maxFreq = count;
maxNumber = number;
}
if(count < minFreq){
minFreq = count;
minNumber = number;
}
}
cout<<maxNumber<<" "<<maxFreq<<endl;
cout<<minNumber<<" "<<minFreq<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCQoJaW50IG47CgljaW4+Pm47CgkKCXZlY3RvcjxpbnQ+IG51bWJlcnMobik7CgkKCWZvcihhdXRvJiBudW1iZXI6IG51bWJlcnMpewoJCWNpbj4+bnVtYmVyOwoJfQoJCgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+IGhhc2hBcnJheTsKCQoJZm9yKGludCBpPTA7IGk8bjsgaSsrKXsKCQloYXNoQXJyYXlbbnVtYmVyc1tpXV0rKzsKCX0KCQoJaW50IG1heEZyZXEgPSBJTlRfTUlOLCBtYXhOdW1iZXIgPSAtMTsKCWludCBtaW5GcmVxID0gSU5UX01BWCwgbWluTnVtYmVyID0gLTE7CgkKCWZvcihhdXRvIGl0ID0gaGFzaEFycmF5LmJlZ2luKCk7IGl0ICE9IGhhc2hBcnJheS5lbmQoKTsgaXQrKyl7CgkJaW50IGNvdW50ID0gaXQtPnNlY29uZDsKCQlpbnQgbnVtYmVyID0gaXQtPmZpcnN0OwoJCQoJCWlmKGNvdW50ID4gbWF4RnJlcSl7CgkJCW1heEZyZXEgPSBjb3VudDsKCQkJbWF4TnVtYmVyID0gbnVtYmVyOwoJCX0KCQkKCQlpZihjb3VudCA8IG1pbkZyZXEpewoJCQltaW5GcmVxID0gY291bnQ7CgkJCW1pbk51bWJlciA9IG51bWJlcjsKCQl9Cgl9CgkKCWNvdXQ8PG1heE51bWJlcjw8IiAiPDxtYXhGcmVxPDxlbmRsOwoJY291dDw8bWluTnVtYmVyPDwiICI8PG1pbkZyZXE8PGVuZGw7CgkKCXJldHVybiAwOwp9