import java.util.Scanner;

public class E {
    static long F[] = new long[41];

    static long fib(int n) {
        if (F[n] != 0) return F[n];
        if (n <= 2) return F[n] = 1;
        return F[n] = fib(n - 1) + fib(n - 2);
    }

    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        while (cin.hasNext()) {
            int N = cin.nextInt();
            for (int i = 1; i <= N; i++)
                System.out.print(fib(i) + " ");
        }
        System.out.println();
        cin.close();
    }


}