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