#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int i, j;
  long long int n, k;
  cin >> n >> k;
  long long int in = 1;
  long long int fib[n + 1];
  fib[0] = fib[1] = 1;
  for (i = 2; i <= n; i++) fib[i] = fib[i - 1] + fib[i - 2];
  while (in <= n) {
    if (k <= fib[n - in]) {
      cout << in << " ";
      in++;
    } else {
      k -= fib[n - in];
      cout << in + 1 << " " << in << " ";
      in += 2;
    }
  }
  cout << endl;
  return 0;
}
