#include <bits/stdc++.h>
using namespace std;

long long X;
vector<long long> fibo = {0,1};
vector<int> ans = {1};
bitset<100> bs;

int main() {
    scanf("%lld", &X);
    while (fibo[fibo.size()-2] + fibo[fibo.size()-1] <= X) fibo.push_back(fibo[fibo.size()-2] + fibo[fibo.size()-1]);
    int K = fibo.size();
    X -= fibo.back();
    while (X) {
        while (fibo.back() > X) fibo.pop_back();
        bs[fibo.size()] = true;
        X -= fibo.back();
    }
    for (int i = 1; i < K-1; ++i) {
        ans.push_back(3+i%2);
        if (bs[K-i]) ans.push_back(1+i%2);
    }
    printf("%d\n", ans.size());
    if (K % 2 == 0) {
        for (int x: ans) printf("%d\n", x);
    }
    else {
        for (int x: ans) {
            if (x <= 2) printf("%d\n", 3-x);
            else printf("%d\n", 7-x);
        }
    }

    return 0;
}

//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) (((n) >> (k)) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = true;
}  // namespace mydef
using namespace mydef;
#define pb push_back
//#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans

int N;

void solve() {
    vector<int> fib(2);
    fib[0] = fib[1] = 1;
    for (int i = 2;; i++) {
        fib.emplace_back(fib[i - 1] + fib[i - 2]);
        if (fib.back() > N)
            break;
    }
    int M = fib.size();

    vp memo;
    memo.emplace_back(0, 0);
    memo.emplace_back(1, 0);
    while (true) {
        auto [x, y] = memo.back();
        if (x + y > N)
            break;
        if (x > y)
            memo.emplace_back(x, x + y);
        else
            memo.emplace_back(x + y, y);
    }
    if (memo.back().first < memo.back().second) {
        for (auto&& [x, y] : memo) {
            swap(x, y);
        }
    }
    /*
    for (auto&& [x, y] : memo) {
        cerr << x << " " << y << endl;
    }
    */
    N -= memo.back().first;
    int inc[2020] = {};
    while (N) {
        int idx = upper_bound(all(fib), N) - fib.begin() - 1;
        inc[idx]++;
        N -= fib[idx];
    }
    vector<int> ans;
    for (int i = 0; i < M - 1; i++) {
        auto [x_now, y_now] = memo[i];
        auto [x_nxt, y_nxt] = memo[i + 1];
        if (x_now != x_nxt) {
            if (i == 0)
                //cout << 1 << endl;
                ans.emplace_back(1);
            else
                //cout << 3 << endl;
                ans.emplace_back(3);
        } else {
            if (i == 0)
                //cout << 2 << endl;
                ans.emplace_back(2);
            else
                //cout << 4 << endl;
                ans.emplace_back(4);
        }
        while (inc[M - 2 - i]) {
            inc[M - i - 2]--;
            //cout << ((M - i - 1) % 2 == 0 ? 2 : 1) << endl;
            ans.emplace_back(((M - i - 1) % 2 == 0 ? 2 : 1));
        }
    }
    cout << ans.size() << endl;
    for (auto&& e : ans) {
        cout << e << endl;
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> N;

    solve();
    return 0;
}
