Toys

Description:

Input:

The first line contains a string $$$t$$$ consisting of uppercase letters of the English alphabet ($$$1\le |t| \le 1000$$$) — the name of the teddy bear.

The second line contains a string $$$o$$$ consisting of uppercase letters of the English alphabet ($$$1\le |o| \le 1000$$$) — the name of the owl.

The third line contains a string $$$r$$$ consisting of uppercase letters of the English alphabet ($$$1\le |r| \le 1000$$$) — the name of the raccoon.

The values $$$|t|$$$, $$$|o|$$$, $$$|r|$$$ denote the length of the three names $$$t$$$, $$$o$$$, $$$r$$$.

Output:

The first line of the output contains a single integer $$$m$$$ — the minimum number of sheets required.

Then $$$m$$$ lines follow: the $$$j$$$-th of these lines contains a string of two uppercase letters of the English alphabet — the letters appearing on the two sides of the $$$j$$$-th sheet.

Note that you can print the sheets and the two letters of each sheet in any order.

Sample Input:

AA
GA
MA

Sample Output:

2
AG
AM

Sample Input:

TEDDY
HEDWIG
RACCOON

Sample Output:

8
AT
CH
CY
DG
DO
ER
IN
OW

Sample Input:

BDC
CAA
CE

Sample Output:

4
AD
AE
BB
CC

Note:

In the first sample, the solution uses two sheets: the first sheet has A on one side and G on the other side; the second sheet has A on one side and M on the other side.

The name AA can be spelled using the A side of both sheets. The name GA can be spelled using the G side of the first sheet and the A side of the second sheet. Finally, the name MA can be spelled using the M side of the second sheet and the A side of the first sheet.