#include <bits/stdc++.h>
using namespace std;
long long n, k, ways[55];
int a[55];
int main() {
  ways[0] = ways[1] = 1;
  for (int i = 2; i < 55; i++) ways[i] = ways[i - 1] + ways[i - 2];
  cin >> n >> k;
  k--;
  for (int i = 1; i <= n; i++) a[i] = i;
  for (int i = 1; i <= n;) {
    if (ways[n - i] > k)
      i++;
    else {
      k -= ways[n - i];
      swap(a[i], a[i + 1]);
      i += 2;
    }
  }
  for (int i = 1; i <= n; i++) cout << a[i] << ' ';
}
