#include <bits/stdc++.h>
using namespace std;
int n;
long long int K;
int ans[100];
long long int fib[100];
int main() {
  scanf("%d%I64d", &n, &K);
  fib[0] = fib[1] = 1, fib[2] = 2;
  for (int i = 3; i <= n; i++) fib[i] = fib[i - 1] + fib[i - 2];
  for (int i = 1; i <= n; i++) ans[i] = i;
  for (int i = 1; i <= n; i++)
    if (K > fib[n - i]) {
      K -= fib[n - i];
      swap(ans[i], ans[i + 1]);
      i++;
    }
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  printf("\n");
  return 0;
}
