#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXLENGTH 102
typedef struct _listNode{
    char strValue[MAXLENGTH+1];
    struct _listNode * next;
}listNode;
typedef struct _listStruct{
    listNode * head;
}listStruct;
void initList(listStruct* list);
void insertNode(listStruct* list, char pstrVal[]);
void printNodes(listStruct* list);
listNode * headNode; listNode * tailNode; listNode * tmpNode;

int main(){
    int testcaseCount;
    char input[MAXLENGTH]="";
    char output[MAXLENGTH]="";
    char buffer[MAXLENGTH];
    listStruct * list = (listStruct*)malloc(sizeof(listStruct));
    initList(list);
    scanf("%d", &testcaseCount);
    while (testcaseCount--){
        int i,j,k,l;
        scanf("%s", input);
        for (i=0,j=0; i < MAXLENGTH; i += 2, j++){
            if (input[j] == '\0' || input[i] == '\0')break;
            output[j] = input[i];

        }
        for (j,k=1; j < MAXLENGTH; j++,k+=2){
            if (input[j] == '\0' || input[k] == '\0')break;
            output[j] = input[k];

        }
        insertNode(list, output);

    }
    printNodes(list);
}
void initList(listStruct* list){
    list->head = NULL;
}
void insertNode(listStruct* list, char pstrVal[]){
    listNode * newNode = (listNode*)malloc(sizeof(listNode));
    strcpy(newNode->strValue, pstrVal);
    newNode->next = NULL;

    if (list->head == NULL){
        list->head = newNode;
        headNode = newNode;
        tailNode = newNode;
    }
    else{
        tmpNode = list->head;
        while (tmpNode->next != NULL){
            tmpNode = tmpNode->next;
        }
        tmpNode->next = newNode;
    }
}
void printNodes(listStruct* list){
    headNode = list->head;
    tailNode = list->head;
    if (headNode != NULL){
        printf("%s\n", headNode->strValue);
        while (tailNode->next != NULL){
            tailNode = tailNode->next;
            printf("%s\n", tailNode->strValue);
        }
    }

}