The program reads from standard input a single natural number, `n`. - `1 <= n <= 12` - A decomposition must have at least one term, so `n` itself is a valid decomposition (with a single term).

The program prints, one per line, all decompositions of `n` as a sum of strictly increasing positive integers. The terms of each decomposition are separated by spaces with no trailing space. Decompositions are printed in lexicographic order (those starting with smaller values come first). On the last line print the total number of decompositions.