#include <bits/stdc++.h>
using namespace std;
long long n, k;
const int MAXN = 105;
long long f[MAXN];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k;
  f[0] = f[1] = 1;
  for (int i = 2; i <= 100; i++) {
    f[i] = f[i - 1] + f[i - 2];
  }
  vector<int> ans;
  for (int i = 1; i <= n;) {
    if (f[n - i] >= k) {
      ans.push_back(i);
      i++;
    } else {
      k -= f[n - i];
      ans.push_back(i + 1);
      ans.push_back(i);
      i += 2;
    }
  }
  for (auto x : ans) {
    cout << x << ' ';
  }
  return 0;
}
