#include<stdio.h>
#include<string.h>

int top =-1,arr[20],n;

int isFull() {
    if(top == n-1){
        return 1;
    }
    else 
        return 0;
}
void enqueue(int num) {
    if(isFull()){
        printf("Stack overflow\n");
        return;
    else
        arr[++top] = num;
}
}
void traverse(){
    int i;
    for(i=0;i<top;i++){
        printf("%d ",arr[i]);
    }
}
int main() {
    int num;
    scanf("%d",&num);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<size;i++){
        printf("%d",num);
        enqueue(num);
    }
    traverse();
    return 0;
}