#include<stdio.h>
int top=-1,arr[20],size;
int isfull(){
    if(top==size-1)
        return 1;
    else
        return 0;
}
void enqueue(int num){
    if(isfull()){
        printf("stack overflow");
        return 0;
    }
    else
        arr[++top]=num;
}
void traverse(){
    int i;
    for(i=0;i<=top;i++){
        printf("%d ",arr[i]);
    }
}
int main(){
    int num;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
    }
    for(i=0;i<size;i++){
        printf("%d",num);
        enqueue(num);
    }
    traverse();
    return 0;
}