from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def solve():
    mn = 10 ** 9
    cc = []
    for c1 in range(1, 150):
        if c1 * (c1 - 1) // 2 > k: break
        c2 = (k - c1 * (c1 - 1) // 2) // c1
        c3 = (k - c1 * (c1 - 1) // 2) % c1 + 1
        cur = c1 + c2 + c3
        if cur < mn:
            mn = cur
            cc = [c1,c2,c3]
    print(mn)
    ans=[1]*cc[0]+[2]*cc[1]+[8]+[23]*(cc[2]-1)
    print(*ans)

k=II()
solve()