#include <iostream> #include <algorithm> using namespace std; struct cave { long long num; long long people = 0; }; bool CMP(cave c1,cave c2) { if(c1.people == c2.people) return c1.num < c2.num; else return c1.people>c2.people; } int main() { cave lst[100005]; long long num; cin >> num; for(int i = 1;i <= num;i++) { int index; cin >> index; lst[index].people++; lst[index].num = index; } sort(lst,lst+100005,CMP); long long index = 0; while(true) { if(lst[index+1].people != 0) { cout << lst[index].num << "->"; } else { cout << lst[index].num; break; } index++; } }