#include <iostream> #include <unordered_map> #include <vector> using namespace std; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } unordered_map<int, int> count; for (int i = 0; i < n; i++) { count[a[i]]++; } int maxCount = 0; int mode = 0; for (auto& pair : count) { if (pair.second > maxCount || (pair.second == maxCount && pair.first < mode)) { maxCount = pair.second; mode = pair.first; } } cout << mode << endl; return 0; }