void fibonacci(int, int, int, int, int, int);
main(){
    int n;
    int count;
    int a1;
    int a2;
    int bckp;
    int bckpa2;
    scanf("%d", &n);
    a1 = 1;
    a2 = 1;
    count = n;
    bckp = n;
    fibonacci(n, count, a1,a2,bckp, bckpa2);
}
void fibonacci(int n, int count, int a1, int a2, int bckp, int bckpa2) {
    if(count == 1){
        if(n == 1){
            printf("%d\n%d\n", a1,a2);
        }
        if(n <= bckp-2){
            printf("%d\n", a1+a2);
            bckpa2 = a2;
            a2 = a1 + a2;
            a1 = bckpa2;
            fibonacci(n+1, count, a1, a2,bckp,bckpa2);
        }
        else{
            return;
        }
    }
    else{
        fibonacci(n-1,count-1,a1,a2,bckp,bckpa2);
    }
}