#include<iostream> #include<algorithm> using namespace std; int n,maxx; struct node{ int pp,ind; }a[2000]; bool cmp(node x,node y){ if(x.pp==y.pp) return x.ind<y.ind; return x.pp>y.pp; } signed main(){ cin>>n; int x=0; for(int i=0;i<n;i++) { cin>>x; a[x].pp++; a[x].ind=x; maxx=max(maxx,x); } sort(a+1,a+maxx+1,cmp); for(int i=1;i<=maxx;i++){ if(a[i].pp==0)continue; if(i!=1) cout<<"->"; cout<<a[i].ind; } return 0; }