# include <algorithm> # include <iostream> # include <memory.h> using namespace std; struct hole{ int p,num; }m[1001]; bool first(hole a,hole b){ if (a.p == b.p) return a.num<b.num?true:false; return a.p>b.p?true:false; }int main(){ memset(m,0,sizeof(m)); int n; cin >> n; for (int i = 0;i < n;i++){ int tmp; cin >> tmp; m[tmp].p++; m[tmp].num = tmp; }sort(m,m+1001,first); int i = 0; while (true){ cout << m[i].num; if (m[i+1].p != 0){ cout << "->"; }else{ return 0; }i++; } return 0; }