#A. XHXMMMl3JIXaWg#'^)`

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n

传统题

2000ms

256MiB

该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Statement

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!

Format

Input

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

Output

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.

Sample

1
1

2
2 2

3
9 9 9

ShanghaiTech ACM 炸鱼杯

未参加

状态: 已结束
规则: OI
题目: 46
开始于: 2024-12-10 23:00
结束于: 2024-12-15 13:00
持续时间: 110 小时
主持人: _Arahc_
参赛人数: 112

#A. XHXMMMl3JIXaWg#'^)`

XHXMMMl3JIXaWg#'^)`

Statement

Format

Input

Output

Sample

ShanghaiTech ACM 炸鱼杯

状态

开发

支持

#A. XHXMMMl3JIXaWg#'^)`

XHXMMMl3JIXaWg#'^)`

Statement

Format

Input

Output

Sample

ShanghaiTech ACM 炸鱼杯

状态

开发

支持

还没有账户？

登录