#include <bits/stdc++.h>
using namespace std;
const int N = 60;
int n, cnt[N] = {0};
long long k, f[N], a[N], b[N];
vector<int> ret;
int main() {
  scanf("%d %I64d", &n, &k);
  f[0] = 0;
  f[1] = 1;
  for (int i = 2; i < N; i++) {
    f[i] = f[i - 1] + f[i - 2];
  }
  for (int i = 0; i < n; i++) {
    a[n - i - 1] = f[i + 1];
    b[n - i - 1] = a[n - i - 1] + f[i];
  }
  for (int i = 0; i < n; i++) {
    vector<int> v;
    for (int j = 0; j < n; j++) {
      if (cnt[j] == 0) {
        v.push_back(j);
      }
    }
    if (k <= a[i]) {
      ++cnt[v[0]];
      ret.push_back(v[0] + 1);
    } else {
      k = k - a[i];
      ++cnt[v[1]];
      ret.push_back(v[1] + 1);
    }
  }
  printf("%d", ret[0]);
  for (int i = 1; i < n; i++) {
    printf(" %d", ret[i]);
  }
  puts("");
  return 0;
}
