CF1104A.Splitting into digits

Vasya has his favourite number $n$. He wants to split it to some non-zero digits. It means, that he wants to choose some digits $d_1, d_2, \ldots, d_k$, such that $1 \leq d_i \leq 9$ for all $i$ and $d_1 + d_2 + \ldots + d_k = n$.

Vasya likes beauty in everything, so he wants to find any solution with the minimal possible number of different digits among $d_1, d_2, \ldots, d_k$. Help him!

瓦西娅有一个他最喜欢的数字 $n$。他想将该数字拆分为若干个非零数字。也就是说，他希望选出一些数字 $d_1, d_2, \ldots, d_k$，使得对所有 $i$ 都有 $1 \leq d_i \leq 9$，且 $d_1 + d_2 + \ldots + d_k = n$。

瓦西娅在一切事物中都追求美感，因此他希望在所有满足条件的解中，找出一个使 $d_1, d_2, \ldots, d_k$ 中不同数字的种类数最少的解。请帮助他！

The first line contains a single integer $n$ — the number that Vasya wants to split ($1 \leq n \leq 1000$).

第一行包含一个整数 $n$ —— Vasya 想要拆分的数字（$1 \leq n \leq 1000$）。

In the first line print one integer $k$ — the number of digits in the partition. Note that $k$ must satisfy the inequality $1 \leq k \leq n$. In the next line print $k$ digits $d_1, d_2, \ldots, d_k$ separated by spaces. All digits must satisfy the inequalities $1 \leq d_i \leq 9$.

You should find a partition of $n$ in which the number of different digits among $d_1, d_2, \ldots, d_k$ will be minimal possible among all partitions of $n$ into non-zero digits. Among such partitions, it is allowed to find any. It is guaranteed that there exists at least one partition of the number $n$ into digits.

第一行输出一个整数 $k$ —— 表示该划分中数字的个数。注意，$k$ 必须满足不等式 $1 \leq k \leq n$。
第二行输出 $k$ 个数字 $d_1, d_2, \ldots, d_k$，以空格分隔。所有数字必须满足不等式 $1 \leq d_i \leq 9$。

你需要找到 $n$ 的一个划分，使得 $d_1, d_2, \ldots, d_k$ 中不同数字的个数在所有将 $n$ 划分为非零数字的划分中达到最小可能值。在所有满足该最小不同数字个数的划分中，任选其一即可。题目保证至少存在一种将 $n$ 划分为数字的方式。

In the first test, the number $1$ can be divided into $1$ digit equal to $1$.

In the second test, there are $3$ partitions of the number $4$ into digits in which the number of different digits is $1$. This partitions are $[1, 1, 1, 1]$, $[2, 2]$ and $[4]$. Any of these partitions can be found. And, for example, dividing the number $4$ to the digits $[1, 1, 2]$ isn't an answer, because it has $2$ different digits, that isn't the minimum possible number.

在第一个测试中，数字 $1$ 可以被划分为 $1$ 个等于 $1$ 的数字。

在第二个测试中，将数字 $4$ 划分为若干数字（每个数字为一位数）且其中不同数字的个数恰好为 $1$ 的划分方式共有 $3$ 种。这些划分方式为 $[1, 1, 1, 1]$、$[2, 2]$ 和 $[4]$。输出其中任意一种即可。例如，将数字 $4$ 划分为数字 $[1, 1, 2]$ 并非合法答案，因为该划分中包含 $2$ 个不同的数字，而这不是可能的最小值。