#include <bits/stdc++.h>
using namespace std;
long long dp[5][101];
int ans[101];
int main() {
  int n;
  long long k;
  cin >> n >> k;
  dp[1][n + 1] = 1;
  for (int i = n; i >= 1; i--) {
    dp[1][i] = dp[1][i + 1] + dp[2][i + 1];
    dp[2][i] = dp[1][i + 2] + dp[2][i + 2];
    ans[i] = i;
  }
  for (int i = 1; i <= n;) {
    if (k <= dp[1][i]) {
      i++;
    } else {
      swap(ans[i], ans[i + 1]);
      k -= dp[1][i];
      i += 2;
    }
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << " \n"[i == n];
  return 0;
}
