/*

 ∧＿∧
( ･ω･｡)つ━☆・*。
⊂　 ノ 　　　・゜
しーＪ　　 Accepted

*/



// #pragma GCC optimize("O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define all(x) begin(x), end(x)
#define x first
#define y second
#define int long long

using namespace std;
using namespace __gnu_pbds;

typedef long double ld;
template<typename T>
using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ld PI = atan2(0, -1);

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(14);
    #ifdef _offline
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
}

const int MAXN = 2e5 + 10;
const int MAXM = 600;
const int INF = 1e18 + 7;
const int BASE = 47;
const int MOD = 998244353;
const int MAXLOG = 61;
const ld EPS = 1e-8;

vector<vector<pair<int, int>>> g;
vector<int> dp, used, par;
map<pair<int, int>, string> mp;

int pf(string &s1, string &s2) {
    string t = s2 + "#" + s1;
    vector<int> p(t.size(), 0);
    for (int i = 1; i < t.size(); i++) {
        p[i] = p[i - 1];
        while (p[i] && t[p[i]] != t[i])
            p[i] = p[p[i] - 1];
        if (t[i] == t[p[i]])
            p[i]++;
    }
    return p[t.size() - 1];
}

signed main() {
    seriy();
    int n;
    cin >> n;
    vector<string> s(n);
    int sum = 0;
    string ans = "";
    for(int i = 0; i < n; i++) {
        cin >> s[i];
        ans += s[i];
        sum += s[i].size();
    }
    // g.resize(n);
    // for(int i = 0; i < n; i++) {
    //     for(int j = 0; j < n; j++) {
    //         string k = s[i] + '#' + s[j];
    //         int pi = prefix_function(k);
    //         g[j].push_back({i, pi});
    //         string res = "";
    //         for(auto p : s[j]) {
    //             res += p;
    //         }

    //         k = s[j] + '#' + s[i];
    //         pi = prefix_function(k);
    //         g[i].push_back({j, pi});
    //     }
    // }
    mt19937 rr(time(0));
    string res = ans;
    for(int i = 0; i < 10000000000000; i++) {
        string cur = "";
        shuffle(all(s), rr);
        string ct = s[0];
        for(int j = 1; j < n; j++) {
            string aut = "";
            for (int p = max(0ll, (int)ct.size() - (int)s[j].size()); p < ct.size(); p++)
                aut += ct[p];
            int gg = pf(aut, s[j]);
            for (int p = gg; p < s[j].size(); p++)
                ct += s[j][p];
            // string k = s[j] + '#' + cur;
            // // cerr << k << '\n';
            // int pi = prefix_function(k);
            // // cerr << pi << '\n';
            // cur += s[j].substr(pi, s[j].size() - pi);
            // cerr << cur << '\n';
        }
        cur = ct;
        if(cur.size() < res.size()) {
            res = cur;
            cout << res.size() << " " << res << '\n';
        }
    }
    cout << res;
    return 0;
}