#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef bitset<16> BS;

const ll MOD = 1E+09 + 7;
const ll INF = 1E18;
const int MAX_N = 1E+05;

int K;

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

    cin >> K;

    int one = 0, zero = 1;
    if (K > 0) {
        for (int i = 2; i <= 30; i++) {
            for (int j = 0; i + j <= 30; j++) {
                int z = (1 << j);
                if (i * (i - 1) / 2 * z == K) {
                    one = i, zero = j;
                }
            }
        }
    }
    //cout << "N = " << N << ", n = " << n << "\n";

    /*
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n";
        }
    }
    */
    cout << one + zero << "\n";
    for (int i = 1; i <= one; i++) {
        cout << 1 << " ";
    }
    for (int i = 1; i <= zero; i++) {
        cout << 0 << " ";
    }
    cout << "\n";

    return 0;
}