# include <iostream> # include <algorithm> using namespace std ; struct cave { int p = 0 , n ; } b [1145] ; bool cmp ( cave a , cave b ) { if ( a . p != b . p ) { return ( a . p > b . p ) ; } else { return ( a . n < b . n ) ; } } int main ( ) { int n , maxn = 0 ; cin >> n ; for ( int i = 1 ; i <= n ; i ++ ) { int a ; cin >> a ; b [a] . p ++ ; b [a] . n = a ; maxn = max ( maxn , a ) ; } sort ( b + 1 , b + maxn + 1 , cmp ) ; for ( int i = 1 ; b [i] . p != 0 ; i ++ ) { cout << b [i] . n ; if ( b [i + 1] . p != 0 ) { cout << "->" ; } } return 0 ; }