Inna and Choose Options

				 ***Inna and Choose Options*** 

There always is something to choose from! And now, instead of “Noughts and Crosses”, Inna choose a very unusual upgrade of this game. The rules of the game are given below:

There is one person playing the game. Before the beginning of the game he puts 12 cards in a row on the table. Each card contains a character: “X” or “O”. Then the player chooses two positive integers a and b (a·b = 12), after that he makes a table of size a × b from the cards he put on the table as follows: the first b cards form the first row of the table, the second b cards form the second row of the table and so on, the last b cards form the last (number a) row of the table. The player wins if some column of the table contain characters “X” on all cards. Otherwise, the player loses.

Inna has already put 12 cards on the table in a row. But unfortunately, she doesn’t know what numbers a and b to choose. Help her win the game: print to her all the possible ways of numbers a, b that she can choose and win.

Input
The first line of the input contains integer t (1 ≤ t ≤ 100). This value shows the number of sets of test data in the input. Next follows the description of each of the t tests on a separate line.

The description of each test is a string consisting of 12 characters, each character is either “X”, or “O”. The i-th character of the string shows the character that is written on the i-th card from the start.

Output
For each test, print the answer to the test on a single line. The first number in the line must represent the number of distinct ways to choose the pair a, b. Next, print on this line the pairs in the format axb. Print the pairs in the order of increasing first parameter (a). Separate the pairs in the line by whitespaces.

Examples
Input
4
OXXXOXOOXOOX
OXOXOXOXOXOX
XXXXXXXXXXXX
OOOOOOOOOOOO
Output
3 1x12 2x6 4x3
4 1x12 2x6 3x4 6x2
6 1x12 2x6 3x4 4x3 6x2 12x1
0
题意：有十二张上边只印有字符X和O的卡片，把他按照a行b列的进行分割，问到最后能不能使得有一列卡片为X，若有的话，输出可以 实现的个数，并且把他按照axb的形式输出（按照a的升序排列）。
思路：12的因子只有1，2 ，3, 4， 6,12.所以可以进行分类讨论。分成一行，只需检查是否有X字符就行，若是两行，只需讨论第i行和第6-1-i列是否都为X字符，分成三行，只需讨论第i列第i+3列第i+6列是否为X字符即可，剩下的也是同样的道理。代码如下：

#include"iostream"
#include"algorithm"
#include"cstring"
#include"queue"
using namespace std;
int n;
char a[105][15];
bool judge1(int j)
{
	for(int i=  0;i < 12;i ++)
	{
		if(a[j][i]=='X')
		{
			return 1;
		}
	}
	return 0; 
}
bool judge2(int i)
{
	for(int j = 0;j < 6;j ++)
	{
		if(a[i][j]=='X' &&a[i][j+6]=='X')
		{
			return 1;
		}
	}
	return 0;
}
bool judge3(int i)
{
	for(int j = 0;j < 4;j ++)
	{
		if(a[i][j]=='X'&&a[i][j+4]=='X'&&a[i][j+8]=='X')
		{
			return 1;
		}
	}
	return 0;
}
bool judge4(int i)
{
	for(int j = 0;j < 3;j ++)
	{
		if(a[i][j]=='X'&&a[i][j+3]=='X'&&a[i][j+6]=='X'&&a[i][j+9]=='X')
		{
			return 1;
		}
	}
	return 0;
}
bool judge5(int i)
{
	for(int j = 0;j < 2;j ++)
	{
		if(a[i][j]=='X'&&a[i][j+2]=='X'&&a[i][j+4]=='X'&&a[i][j+6]=='X'&&a[i][j+8]=='X'&&a[i][j+10]=='X')
		{
			return 1;
		}
	}
	return 0;
}bool judge6(int i)
{
	for(int j = 0;j < 12;j ++)
	{
		if(a[i][j]!='X')
		{
			return 0;
		}
	}
	return 1;
}
int main()
{
	char b[7][10]={"1x12","2x6","3x4","4x3","6x2","12x1"};
	cin >> n;
	for(int i = 0;i < n;i ++)
	{
		cin >> a[i];
	}
	for(int i = 0;i < n;i ++)
	{
		int sum = 0;
		int c[7]={0};
		if(judge1(i))
		{
			sum++;
			c[0]=1;
		}
		if(judge2(i))
		{
			sum++;
			c[1]=1;
		}
		if(judge3(i))
		{
			sum++;
			c[2]=1;
		}
		if(judge4(i))
		{
			sum++;
			c[3]=1;
		}
		if(judge5(i))
		{
			sum++;
			c[4]=1;
		}
		if(judge6(i))
		{
			sum++;
			c[5]=1;
		}
		cout<<sum;
		for(int i = 0;i < 6;i ++)
		{
			if(c[i]==1)
			{
				cout<<' '<<b[i];
			}
		}
		cout<<endl;
	}
	return 0;
}