#include<stdio.h>
int size,top=-1;
int arr[5];
int isFull(){
    if(top==size-1){
        return 1;
    }
    else
        return 0;
}
void enQueue(int num){
    if(isFull()){
        printf("queue is full");
    }
    else
        arr[++top]=num;
}
void traverse(){
    Node *itr;
    for(itr=0;itr<=top;top++){
        printf("%d",arr[i]);
    }
}
int main(){
    int num,size,itr;
    scanf("%d",&size);
    for(itr=1;itr<=size;itr++){
        scanf("%d",&num);
        create(num);
    }
    traverse();
    return 0;
}