include[HTML_REMOVED]

using namespace std;

int dfs(int n){
if(n == 1) return 0;
if(n == 2) return 1;
return dfs(n - 1) + dfs(n - 2);//递归
}

int main(){
int n;
cin >> n;
int a = 0,b = 1;
for(int i = 1; i <= n; i ++) cout << dfs(i) << ‘ ‘;
return 0;
}