Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

HS10SUMS - Sums and addends

Given a natural number n, please find all non-decreasing sequences of integers, such that the sum of all the elements of the sequence is equal to n. Numbers in the sequence may repeat. Due to the imposed politically correct "parity policy" each valid sequence must contain the same number of odd and even elements.

Input data specification

The first line contains the number of test cases t. Each of the following t lines contains just one number 1 <= n <= 40.

Output data specification

For each test case print all possible sequences satisfying the problem criteria. Sequences must be given in the lexicographic order, with each sequence printed in a separate line.

If no valid sequence exists for a given value of n, print the text "Impossible".

Example 1

Input:
3
4
8
7

Output:
Impossible
1 1 2 4
1 2 2 3
1 6
2 5
3 4

Scoring

By solving this problem you will score 10 points.


Added by:kuszi
Date:2010-11-02
Time limit:1s
Source limit:15000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM32-GCC GAWK MAWK BC C-CLANG NCSHARP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV ICK JS-MONKEY JULIA KTLN NIM NODEJS OBJC OBJC-CLANG OCT PICO PROLOG PYPY PYPY3 PY_NBC R RACKET RUST CHICKEN SED SQLITE SWIFT UNLAMBDA VB.NET
Resource:High School Programming League 2010/11

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.