#include <bits/stdc++.h>
using namespace std;
const int N = 444444;
long long mod = 1000 * 1000 * 1000 + 7;
using namespace std;
long long F[555];
int pat[555];
int main() {
  int n;
  long long k;
  cin >> n >> k;
  F[0] = 1;
  F[1] = 1;
  for (int i = 2; i <= n; ++i) F[i] = F[i - 1] + F[i - 2];
  for (int i = 1; i <= n; ++i) {
    if (F[n - i] >= k) {
      pat[i] = i;
    } else {
      k -= F[n - i];
      pat[i] = i + 1;
      pat[i + 1] = i;
      i++;
    }
  }
  for (int i = 1; i <= n; ++i) {
    cout << pat[i] << " ";
  }
  return 0;
}
