i need help..

i am NOT asking you to do it for me.. i just need some idea coz i can't really understand the problem.. here it is:

Consider the sequence of digits from 1 through N (where N=9) in increasing

order

1 2 3 4 5 . . . N

and insert either a (+) for addition or a (-) for subtraction or a ( ) [blank]

to run the digits together. Now sum the result and see if you get zero.

Write a program that will find all sequences of length N that produce a ZERO

SUM.

Test Case 1

Input

7

Output

1 + 2 - 3 + 4 - 5 - 6 + 7 = 0

1 + 2 - 3 - 4 + 5 + 6 - 7 = 0

1 - 2 + 3 + 4 - 5 + 6 - 7 = 0

1 - 2 - 3 - 4 - 5 + 6 + 7 = 0

1 - 23 + 4 + 5 + 6 + 7 = 0

1 - 23 - 45 + 67 = 0

Test Case 2

Input

8

Output

1 + 2 + 3 + 4 - 5 - 6 - 7 + 8 = 0

1 + 2 + 3 - 4 + 5 - 6 + 7 - 8 = 0

1 + 2 - 3 + 4 + 5 + 6 - 7 - 8 = 0

1 + 2 - 3 - 4 - 5 - 6 + 7 + 8 = 0

1 + 23 - 45 + 6 + 7 + 8 = 0

1 - 2 + 3 - 4 - 5 + 6 - 7 + 8 = 0

1 - 2 - 3 + 4 + 5 - 6 - 7 + 8 = 0

1 - 2 - 3 + 4 - 5 + 6 + 7 - 8 = 0

1 - 23 - 4 + 5 + 6 + 7 + 8 = 0

12 - 34 -56 + 78 = 0