An addition rebus is a puzzle where you get an addition equation, like

ABC+CBA=BDB

, and you're asked to replace each letter with a digit (from 0 through 9) in such a way that:

• Equal letters are replaced with equal digits.
• Different letters are replaced with different digits.
• None of the resulting numbers starts with 0, unless the entire number is just 0.
• The resulting equation holds.

A proper addition rebus is an addition rebus with exactly one solution. An aligned addition rebus is an addition rebus where all three involved numbers have the same length (number of digits). The above addition rebus is aligned, but isn't proper:

143+341=484

and

341+143=484

are its two possible different solutions (and there are more).

Find 1000 different proper aligned addition rebuses. Two rebuses are different if there is no one-to-one mapping from the set of 26 English letters on itself that transfers one of those rebuses into another. For example,

ABC+CBA=BDB

and

XAY+YAX=AZA

are not different, while

ABC+CBA=BDB

and

ABC+DEF=GHI

are different.

The input file will be empty.

Output any 1000 different proper aligned addition rebuses, one per line. Each rebus may only use capital English letters, symbols '

+

' and '

=

'. Each rebus must be at most 100 characters long.

Note that this example output doesn't contain the required 1000 rebuses, it contains just two.

sample input	sample output
	AABC+AABB=DBCB RRR+TTR=EDT