#include<bits/stdc++.h> #define int long long using namespace std; struct node { int ip,val; }a[1010]; inline int init() { for(int i=1;i<=1010;++i) a[i].ip=-1, a[i].val=1; } int n,x,cnt=1; inline bool cmp1(node x,node y) { return x.val<y.val; } inline bool cmp2(node x,node y) { if(x.val==y.val) return x.ip<y.ip; } signed main() { init(); cin>>n; for(int i=1;i<=n;++i) { bool f=0; cin>>x; for(int j=1;j<=cnt;++j) if(a[j].ip==x) a[j].val+=1, f=1; if(!f) a[cnt++].ip=x; } sort(a+1,a+cnt,cmp1); sort(a+1,a+cnt,cmp2); for(int i=1;i<=cnt-1;++i) (i!=cnt-1)?cout<<a[i].ip<<"->":cout<<a[i].ip; return 0; }