import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==================================================================
    long[][] dp;			
    public void make_comb_dp(int n) {			
        dp = new long[n+1][n+1];			
        for(int i = 0; i < n+1; i++) {			
            dp[i][0] = 1L;			
            dp[i][i] = 1L;			
        }			
        for(int i = 2; i < n+1; i++) {			
    	    for(int j = 1; j < i; j++) {		
                dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];			
    	    }		
        }			
    }			
    // 二項係数を返す			
    boolean initFlag = false;			
    public long combination(int n, int k) {			
    	if(!initFlag){		
    		make_comb_dp(n);	
    		initFlag = true;	
    	}		
    	return(dp[n][k]);		
    }			
    public void solve() {
    	long K = Long.parseLong(sc.next());
    	if(K == 0) {
    		out.println("1");
    		out.println("1");
    		return;
    	}
    	long[] C = new long[31];
    	for (int i = 30; i >= 2; i--) {
			C[i] = combination(i, 2);
//			out.println("C[" + i + "] = " + C[i]);
    	}
    	for (int i = 30; i >= 2; i--) {
			if(C[i] <= K && K % C[i] == 0) {
				long wk = K / C[i];
				int cnt = 0;
				boolean f = true;
				while(wk > 1) {
					if(wk % 2 == 0)	{
						wk /= 2;
						cnt++;
					} else {
						f = false;
						break;
					}
				}
				if(!f)	continue;
				if((i + cnt) > 30) {
//					out.println(" i = " + i + "  cnt = " + cnt);
					continue;
				}
				out.println(i + cnt);
				for (int j = 0; j < i; j++) {
					out.print("1 ");
				}
				for (int j = 0; j < cnt; j++) {
					out.print("0 ");
				}
				out.println("");
				return;
			}
		}
    }
}