//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#include <stdexcept>
#ifdef DEBUG
#include "./CompetitiveProgrammingCpp/Utils/debug.hpp"
#include "./CompetitiveProgrammingCpp/Utils/Timer.hpp"
#include "./CompetitiveProgrammingCpp/Utils/sample.hpp"
#else
#define dump(...)
template<class T>constexpr inline auto d_val(T a, T b) { return a; }
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VVVVL = std::vector<VVVL>;
using VVVVVL = std::vector<VVVVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;
template<class T = ll, class U = T>
using P = std::pair<T, U>;
using PAIR = P<ll>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::deque;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for(T& x : vec) is >> x; return is; }

/* constant value */
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;

//=============================================================================================


constexpr auto nullLambda = [](int n) {};
template<class Val = bool, Val ignore = false>
class TrieTree {
public:
    Val m_val;
    std::vector<std::shared_ptr<TrieTree>> m_next;
    //static constexpr auto nullLambda = [](ll n) {}; c++17

    auto emplace(const std::vector<int>& vec, Val val, int it) {
        m_val += val;
        if(it == vec.size()) { return; }
        if(!m_next[vec[it]]) {
            m_next[vec[it]] = std::make_shared<TrieTree>();
        }
        m_next[vec[it]]->emplace(vec, val, it + 1);
    }

    template<class Lambda>
    auto find(const std::vector<int>& vec, int it, const Lambda& lambda)const {
        if(m_val != ignore) { lambda(m_val); }
        if(it == vec.size()) { return m_val; }
        if(!m_next[vec[it]]) { return ignore; }
        return m_next[vec[it]]->find(vec, it + 1, lambda);
    }

    TrieTree() : TrieTree(ignore) {}
    TrieTree(Val val) :m_val(val), m_next(std::vector<std::shared_ptr<TrieTree>>(2)) {}

    auto emplace(const std::vector<int>& vec, Val val) { return emplace(vec, val, 0); }

    template<class Lambda = decltype(nullLambda)>
    auto find(const std::vector<int>& vec, const Lambda& lambda = nullLambda) { return find(vec, 0, lambda); }
};

auto solve(ll n, const VS& s) {
    auto tt = std::make_shared<TrieTree<ll, 0>>();
    REPC(t, s) {
        V<int> v; v.reserve(n);
        REPC(c, t) { v.emplace_back((c == 'a' ? 0 : 1)); }
        tt->emplace(v, 1);
    }
    ll d = n;
    string ans;
    REP(_, n) {
        if(!tt->m_next[0]) { while(ans.size() < n) { ans += 'a'; }break; }
        if(!tt->m_next[1]) { while(ans.size() < n) { ans += 'b'; }break; }
        if(tt->m_next[0]->m_val != n) {
            ans += 'a';
            d -= tt->m_next[1]->m_val;
            tt = tt->m_next[0];
        } else {
            ans += 'b';
            d -= tt->m_next[0]->m_val;
            tt = tt->m_next[1];
        }
    }
    return ans;
}

signed main() {
    ll n;
    cin >> n;
    VS s(n);
    cin >> s;
    auto ans = solve(n, s);
    cout << ans << endl;
}