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