G - Five-In-a-Row CodeForces - 825B

Alice and Bob play 5-in-a-row game. They have a playing field of size 10 × 10. In turns they put either crosses or noughts, one at a time. Alice puts crosses and Bob puts noughts.

In current match they have made some turns and now it's Alice's turn. She wonders if she can put cross in such empty cell that she wins immediately.

Alice wins if some crosses in the field form line of length not smaller than 5. This line can be horizontal, vertical and diagonal.

Input

You are given matrix 10 × 10 (10 lines of 10 characters each) with capital Latin letters 'X' being a cross, letters 'O' being a nought and '.' being an empty cell. The number of 'X' cells is equal to the number of 'O' cells and there is at least one of each type. There is at least one empty cell.

It is guaranteed that in the current arrangement nobody has still won.

Output

Print 'YES' if it's possible for Alice to win in one turn by putting cross in some empty cell. Otherwise print 'NO'.

Example

Input

XX.XX.....
.....OOOO.
..........
..........
..........
..........
..........
..........
..........
..........

Output

YES

Input

XXOXX.....
OO.O......
..........
..........
..........
..........
..........
..........
..........
..........

Output

NO

从（0,0）开始寻找，如果这个点是. 就从这个点的右边搜左边搜，一旦这个点不是X，就停止循环，如果搜到x的个数为4，就标记一下，同理，向上向下，斜着。

#include<stdio.h>
#include<string.h>
char a[12][12];
int flag;
void dfs(int x,int y)
{
    int s=0,i,j;     //左右
    for(i=x-1; i>=0; i--)
        if(a[i][y]=='X')s++;
        else break;
    for(i=x+1; i<10; i++)
        if(a[i][y]=='X')s++;
        else break;
    if(s>=4)flag=1;


    s=0;
    for(i=y-1; i>=0; i--)//上下
        if(a[x][i]=='X')s++;
        else break;
    for(i=y+1; i<10; i++)
        if(a[x][i]=='X')s++;
        else break;
    if(s>=4)flag=1;

    s=0;
    for(i=x+1,j=y+1; i<10&&j<10; i++,j++)  //向下斜，一定要注意&&
        if(a[i][j]=='X') s++;
        else break;
    for(i=x-1,j=y-1; i>=0&&j>=0;  i--,j--)
        if(a[i][j]=='X')s++;
        else break;
    if(s>=4)flag=1;

    s=0;
    for(i=x-1,j=y+1; i>=0&&j<10; i--,j++)//向上斜
        if(a[i][j]=='X')s++;
        else break;
    for(i=x+1,j=y-1; i<10&&j>=0; i++,j--)
        if(a[i][j]=='X')    s++;
        else break;
    if(s>=4)flag=1;


}
int main()
{
    int i,j;
    flag=0;
    for(i=0; i<10; i++)
        scanf("%s",a[i]);
    for(i=0; i<10; i++)
    {
        for(j=0; j<10; j++)
        {

            if(a[i][j]=='.')
            {
                    dfs(i,j);
            }
        }
    }
    if(flag)printf("YES\n");
    else printf("NO\n");


}