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, ..., d_k, such that 1 ≤ d_i ≤ 9 for all i and d_1 + d_2 + ... + 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, ..., d_k. Help him!
The first line contains a single integer n — the number that Vasya wants to split (1 ≤ n ≤ 1000).
In the first line print one integer k — the number of digits in the partition. Note that k must satisfy the inequality 1 ≤ k ≤ n. In the next line print k digits d_1, d_2, ..., d_k separated by spaces. All digits must satisfy the inequalities 1 ≤ d_i ≤ 9.
You should find a partition of n in which the number of different digits among d_1, d_2, ..., 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.
1
1 1
4
2 2 2
27
3 9 9 9
NoteIn 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.