#include<iostream> #include<cstdio> #include<algorithm> using namespace std; struct node{ int id,x; }; const int MR=1010; node b[MR]; bool cmp(node x,node y){ if(x.x==y.x) return x.id<y.id; return x.x>y.x; } int main(){ int n,i,j,a; cin>>n; for(i=1;i<MR;i++) b[i].id=i; for(i=1;i<=n;i++){ cin>>a; b[a].x++; } sort(b+1,b+1001,cmp); cout<<b[1].id; for(i=2;i<MR;i++){ if(b[i].x==0) break; else cout<<"->"<<b[i].id; } return 0; }