codeforces A. Inna and Choose Options

A. Inna and Choose Options

time limit per test1: second
memory limit per test:256 megabytes
input:standard input
output:standard output

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

分析

简单的题目；
题意大概是 t 次给出12张卡，只有 X 和 O 两种；要求这十二张卡分割为不同的矩阵，像第一行的“OXXXOXOOXOOX”可以分割为：
(4x3)
OXX
XOX
OOX
OOX
然后看每一列是否有全为 X 的情况，有就输出为 行x列 的形式；
像是：
(3x4)
OXXX
OXOO
XOOX
就没有符合的情况；
那么就按12的因数由小到大按因数的差扫一下，符合情况记录，扫完就输出情况个数再输出情况；

代码

#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<algorithm>
#include<stack>
#define MS(X) memset(X,0,sizeof(X))
#define MSC(X) memset(X,-1,sizeof(X))
typedef long long LL;
using namespace std;
char save[101][14];
char cans[13][5]={"","12x1","6x2","4x3",
	"3x4","","2x6","","","","","","1x12"};
int t,chk[6]={1,2,3,4,6,12};
stack<int> q;
int main(){
    scanf("%d",&t);
    for(int i=0;i<t;i++){
        scanf("%s",save[i]+1);
    }
    bool flag;
    int cnt=0;
    for(int i=0;i<t;i++){
        cnt=0;
        for(int j=0;j<6;j++){
            for(int t=1;t<=chk[j];t++){
                int p=t;
                flag=true;
                for(;p<=12;p+=chk[j]){
                    if(save[i][p]!='X') flag=false;
                }
                if(flag){
                    q.push(chk[j]),cnt++;
                    break;
                }
            }
        }
        printf("%d",cnt);
        while(!q.empty()){
            int a=q.top();
            q.pop();
            printf(" %s",cans[a]);
        }
        printf("\n");
    }
    return 0;
}