#include <bits/stdc++.h> using namespace std; int arr[100005]; struct cave{ int num; int no; }cv[1005]; int cmp(const cave& a,const cave& b){ return a.num>b.num; } int main(){ int n; cin>>n; int cnt = 0; for(int i = 0;i<n;i++){ cin>>arr[i]; cv[arr[i]].num++; if(cv[arr[i]].num==1) cnt++; cv[arr[i]].no = arr[i]; } sort(cv,cv+n,cmp); for(int i = 0;i<cnt;i++){ if(i==0) { cout<<cv[i].no; } else cout<<"->"<<cv[i].no; } cout<<endl; return 0; }