#include <bits/stdc++.h>
using namespace std;
int ans[55];
long long f[55];
int main() {
  int n;
  long long m;
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    ans[i] = i;
  }
  f[0] = f[1] = 1;
  for (int i = 2; i <= n; ++i) {
    f[i] = f[i - 1] + f[i - 2];
  }
  int pos = 1;
  while (pos <= n) {
    if (m <= f[n - pos]) {
      ++pos;
    } else {
      m -= f[n - pos];
      swap(ans[pos], ans[pos + 1]);
      pos += 2;
    }
  }
  for (int i = 1; i <= n; ++i) {
    printf("%d ", ans[i]);
  }
  return 0;
}
