import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

K=int(readline())
for a1 in range(251):
    for a2 in range(251-a1):
        for a3 in range(251-a1-a2):
            cnt=(a1+a3)*a2+a1*(a1-1)//2
            if K==cnt:
                print(a1+a2+a3)
                print(*[1]*a1+[2]*a2+[3]*a3)
                exit()