require 'prime'

K = gets.to_i

def solver(k)
  if k < 5050
    n = (1..100).find { |x| (1..x).sum > k } - 1
    ans = [1] * n + [2] + [8]
    remain = k - (1..n).sum

    remain.times do
      ans << 23
    end

    ans
  else
    ans = [1] * 100 + [2]
    remain = k - 5050

    (remain / 100).times do
      ans << 2
    end

    ans << 8
    remain %= 100
    remain.times do
      ans << 23
    end

    ans
  end
end

res = solver(K)
puts res.size
puts res.join(' ')