assemble spaghetti

import java.util.*;
import java.io.*;
import java.math.*;

/**
 * Auto-generated code below aims at helping you parse
 * the standard input according to the problem statement.
 **/
class Solution {

    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        int N = in.nextInt();
        String tab[] = new String[N];
        int taken[] = new int[N];
        if (in.hasNextLine()) {
            in.nextLine();
        }
        for (int i = 0; i < N; i++) {
            String spaghettiPart = in.nextLine();
            tab[i] = spaghettiPart;
        }
        String res = "";
       // while(!allTaken(taken))
        //{
            for(int i = 0; i < tab.length; i++)
            {
                for(int j = 0; j < tab.length; j++)
                {
                    if(tab[i].charAt(tab[i].length()-1) == tab[j].charAt(0))
                    {
                    //if(taken[i-1] == 0 && taken[i] == 0)
                    //{
                           //taken[i-1] = 1;
                           //taken[i] = 1;
                           //res += tab[i];
                            for(int g = 0; g < tab[i].length()-1; g++)
                            {
                                res += tab[i].charAt(g);
                            }
                           res += tab[j];
                   // }
                    }
                }
                //System.out.println("debut av : "+ tab[i-1].charAt(tab[i-1].length()-1));
                //System.out.println("fin ap : " +tab[i].charAt(0));

            }
        //}

        System.out.println(res);
    }
    public static boolean allTaken(int tab[])
    {
        boolean retour = true;
        for(int i = 0; i < tab.length; i++)
            if(tab[i] == 0)
                retour = false;
        return retour;
    }
}