#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long f[60];
long long g[60];
long long ans[60], t, q, p, e;
int main() {
  scanf("%I64d%I64d", &n, &k);
  f[0] = 1;
  f[1] = 1;
  f[2] = 2;
  for (int i = 3; i <= n; i++) f[i] = f[i - 1] + f[i - 2];
  t = 0, q = n;
  for (int i = 1; i <= n; i++) g[i] = i;
  while (q > 0) {
    if (k <= f[q - 1]) {
      t++;
      ans[t] = t;
      q--;
    } else {
      ans[t + 1] = t + 2;
      ans[t + 2] = t + 1;
      t += 2;
      k -= f[q - 1];
      q -= 2;
    }
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
