laba_stepan

#include <iostream>

using namespace std;


int main() {
    int N;
    cin >> N;
    char a[N][101];
    for (int k = 0; k < N; k++) {
        for (int i = 0; i < 101; i++) a[k][i] = 0;
    }

    for (int k = 0; k < N; k++)
        cin >> a[k];

    int size[N] = { 0 };
    for (int k = 0; k < N; k++) {
        int i = 0;
        while (a[k][i] != 0) i++;
        size[k] = i;
    }


    int max = 0, max_n = 0;
    for (int k = 0; k < N; k++) {
        if (a[k][0] - 48 > max) {
            max_n = k;
            max = a[k][0] - 48;
        }
    }
        long res = max;

        for (int k = 1; k < size[max_n]; k++)
            res = res * 10 + a[max_n][k] - 48;
        a[max_n][0] = 0;

        for (int k = 1; k < N; k++) {
            max = -1; max_n = 0;
            for (int m = 0; m < N; m++) {
                if (a[m][0] - 48 >= max) {
                    if(a[m][0]-48 == max){
                        int c_old = max, c_new = a[m][0] - 48;
                        if(size[max_n] > 1){ // считаем old
                            for(int g = 1; g < size[max_n]; g++){
                                c_old = c_old * 10 + a[max_n][g] - 48;
                            }
                        }
                        for(int g = 0; g < size[m]; g++){
                            c_old = c_old * 10 + a[m][g] - 48;
                        }

                        if(size[m] > 1){ // считаем new
                            for(int g = 1; g < size[m]; g++){
                                c_new = c_new * 10 + a[m][g] - 48;
                            }
                        }
                        for(int g = 0; g < size[max_n]; g++){
                            c_new = c_new * 10 + a[max_n][g] - 48;
                        }

                        if(c_new > c_old){
                            max_n = m;
                            max = a[m][0] - 48;
                        }

                    }
                    else{
                        max_n = m;
                        max = a[m][0] - 48;
                    }

                }
            }
        //  cout << max << endl;
            for (int z = 0; z < size[max_n]; z++)
                res = res * 10 + a[max_n][z] - 48;
            a[max_n][0] = 0;

        }
        cout << res << endl;
    }