#include <bits/stdc++.h> using namespace std; struct node{ int x,p; }; bool cmp(node n1, node n2) { if(n1.x == n2.x)return n1.p < n2.p; return n1.x > n2.x; } node a[100005]; signed main() { int n; cin >> n; int tmp; for(int i = 1; i <= 100000; i++)a[i].p = i; for(int i = 1; i <= n; i++) { cin >> tmp; a[tmp].x++; } sort(a+1,a+n+1,cmp); for(int i = 1; i <= n; i++) { //cout << a[i].p << " "; if(a[i+1].x!=0) { cout << a[i].p << "->"; } else { cout << a[i].p; break; } } return 0; }