#include<bits/stdc++.h> using namespace std; struct aw{ int id; int num; }a[10001]; bool pd(aw b,aw c){ if(b.num!=c.num)return b.num>c.num; else return b.id<c.id; } int main() { int n; cin>>n; int maxn = 0; for(int i=1;i<=n;i++){ int x; cin>>x; maxn = max(maxn,x); a[x].num++; a[x].id = x; } sort(a+1,a+maxn+1,pd); cout << a[1].id; for(int i = 2; i < maxn; i++) if(a[i].num) cout << "->" << a[i].id; cout << endl; return 0; }