#include <bits/stdc++.h>
using namespace std;
int n, ans[60], step;
long long k, f[60];
int main() {
  scanf("%d%I64d", &n, &k);
  f[1] = 1;
  f[0] = 1;
  for (int i = 2; i <= n; i++) f[i] = f[i - 1] + f[i - 2];
  step = 1;
  while (step <= n) {
    if (k <= f[n - step]) {
      ans[step] = step;
      step++;
    } else {
      k -= f[n - step];
      ans[step] = step + 1;
      ans[step + 1] = step;
      step += 2;
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
}
