Composed Rhythms
Time limit1sMemory limit1024 MB
Given N, the task is to split N into groups of sizes 2 and 3 that sum to exactly N and print one valid decomposition.
- Level
Easy2 of 10
- Topics
- Math, Implementation
- Solved
- No attempts yet
Problem
A rhythm is composed of multiple beats. A single beat does not make up a rhythm, as the beats depend on each other. The rhythm can be subdivided into smaller components. For example, a rhythm of beats can be subdivided into beats and beats, or alternatively into , , and beats. However, a rhythm of beats cannot be subdivided into , , and beats, since one of the components does not form a rhythm.
This leaves as the smallest group size of beats we can use to decompose a rhythm, but if we only use groups of size then we cannot have an odd number of beats. Adding as a group size allows us to decompose any rhythm, even if it has an odd number of beats.
Given the number of beats in a rhythm, provide one decomposition of the rhythm into groups of sizes and .
Input
The first and only line of input contains a single integer (), the number of beats in the rhythm.
Output
First output one line with an integer , the number of groups in your decomposition. Then output a line with space-separated integers, each of which is or . The groups must add up to exactly beats. If there are multiple correct answers, you may output any of them.