#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n, long long m) {
  long long ret = n % m;
  if (ret < 0) ret += m;
  return ret;
}
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long exp(long long a, long long b, long long m) {
  if (b == 0) return 1;
  if (b == 1) return mod(a, m);
  long long k = mod(exp(a, b / 2, m), m);
  if (b & 1) {
    return mod(mod(k * k, m) * a, m);
  } else
    return mod(k * k, m);
}
int32_t main() {
  long long n;
  cin >> n;
  long long k;
  cin >> k;
  long long fib[n + 3];
  fib[0] = fib[1] = 1;
  for (long long i = 2; i <= n; i++) fib[i] = fib[i - 1] + fib[i - 2];
  long long idx = 0;
  long long res[n + 3];
  while (idx < n) {
    if (k <= fib[n - idx - 1]) {
      res[idx] = idx + 1;
      idx++;
    } else {
      k -= fib[n - idx - 1];
      res[idx] = idx + 2;
      res[idx + 1] = idx + 1;
      idx += 2;
    }
  }
  for (long long i = 0; i < n; i++) cout << res[i] << " ";
  cout << "\n";
}
