Team Tic Tac Toe

Farmer John owns 26 cows. Their names all start with different letters of the alphabet, so Farmer John refers to each cow by her first initial, a character in the range $A \ldots Z$.

The cows have recently become fascinated by tic-tac-toe. They dislike that only two cows can play at a time, so they invented a variant where many cows play at once. The board is $3 \times 3$, just like regular tic-tac-toe, but instead of Xs and Os every square holds a single character in the range $A \ldots Z$: the initial of the cow who claims that square.

The cows fill in all nine squares and then get confused about who won. As in regular tic-tac-toe, a cow who has claimed an entire row, column, or diagonal by herself can claim victory alone. Since that looks unlikely with so many players, the cows also allow teams of two. A team of two cows can claim victory if some row, column, or diagonal consists only of characters belonging to those two cows, and the characters of both cows appear in that line.

Count how many individual cows can claim victory and how many two-cow teams can claim victory. The same square may be used in several different claims to victory.

The input consists of three lines, each of which is three characters in the range $A \ldots Z$.

Output two lines. On the first line, print the number of individual cows who can claim victory. On the second line, print the number of two-cow teams that can claim victory.

In the first example no single cow can claim victory. Cows C and X team up and win on the diagonal running from the top left to the bottom right, whose letters are C, X, C. Cows X and O team up and win on the middle row.

There are two diagonals, one from the top left to the bottom right and one from the top right to the bottom left. That gives 8 lines to check: 3 rows, 3 columns and 2 diagonals.