#include <bits/stdc++.h>
using namespace std;
long long F[55];
int n, ans[55];
long long K;
int main() {
  F[0] = F[1] = 1;
  for (int i = 2; i <= 52; i++) F[i] = F[i - 1] + F[i - 2];
  scanf("%d%lld", &n, &K);
  for (int i = 1; i <= n;) {
    if (K <= F[n - i])
      ans[i] = i, i = i + 1;
    else
      ans[i] = i + 1, ans[i + 1] = i, K -= F[n - i], i = i + 2;
  }
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  return 0;
}
