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'.

Examples

Input

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


Output

YES


Input

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


Output

NO
/*
 * PDPM IIITDM Jabalpur
 * Asutosh Rana
 */

import java.util.*;
import java.io.*;
import java.math.*;

public class Main
{
    long MOD = 1000000007;
    InputReader in;BufferedReader br;PrintWriter out;
    public static void main (String[] args) throws java.lang.Exception
    {
        Main solver = new Main();
        solver.in = new InputReader(System.in);
        solver.br = new BufferedReader(new InputStreamReader(System.in));
        solver.out = new PrintWriter(System.out);
        solver.solve();
        solver.out.flush();
        solver.out.close();
    }

    char[][] S;
    public void solve(){
        
        int tc = 1;//in.readInt();
        
        for(int cas=1;cas<=tc;cas++){
            int N = 10;//in.readInt();
            S = new char[N][];
            
            for(int i=0;i<N;i++){
                S[i] = in.readCharA();
            }

            int flag = 0;
            for(int i=0;i<N && flag==0;i++){
                for(int j=0;j<N && flag==0;j++){
                    if(S[i][j]=='.'){
                        S[i][j]='X';
                        if(validate())
                            flag=1;
                        S[i][j]='.';
                    }
                }
            }

            if(flag==1){
                out.println("YES");
            }
            else{
                out.println("NO");
            }
        }

    }

    public boolean validate(){
        int N = S.length;
        for(int i=0;i<N;i++){
            int countH = 0, countV = 0;
            for(int j=0;j<N;j++){
                if(S[i][j]=='X'){
                    countH++;
                }
                else
                    countH=0;
                if(S[j][i]=='X')
                    countV++;
                else
                    countV=0;
                if(countH>=5 || countV>=5)
                    return true;
            }
        }

        for(int j1=0;j1<N;j1++){
            int j = j1, i=0,count = 0;
            while(i<N && j<N){
                if(S[i][j]=='X'){
                    count++;
                }
                else{
                    count = 0;
                }
                if(count>=5)
                    return true;
                i++;j++;
            }

            j=j1;i=N-1;count = 0;
            while(i<N && i>=0 && j<N && j>=0){
                if(S[i][j]=='X'){
                    count++;
                }
                else
                    count = 0;
                if(count>=5)
                    return true;
                i--;j++;
            }            
        }

        for(int i1=0;i1<N;i1++){
            int i = i1, j = 0, count = 0;
            while(i<N && i>=0 && j<N && j>=0){
                if(S[i][j]=='X'){
                    count++;
                }
                else
                    count = 0;
                if(count>=5)
                    return true;
                i--;j++;
            }

            i=i1;j=0;count=0;
            while(i<N && j<N){
                if(S[i][j]=='X'){
                    count++;
                }
                else{
                    count = 0;
                }
                if(count>=5)
                    return true;
                i++;j++;
            }           
        }

        return false;
    }
    
}
 
class InputReader{
    private InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;
    private SpaceCharFilter filter;

    public InputReader(InputStream stream){this.stream = stream;}
    public int read(){
        if (numChars==-1) throw new InputMismatchException();
        if (curChar >= numChars){
            curChar = 0;
            try {numChars = stream.read(buf);}
            catch (IOException e){throw new InputMismatchException();}
            if(numChars <= 0) return -1;
        }
        return buf[curChar++];
    }

    public int readInt(){
        int c = read();
        while(isSpaceChar(c)) c = read();
        int sgn = 1;
        if (c == '-') {sgn = -1;c = read();}
        int res = 0;
        do {
            if(c<'0'||c>'9') throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        }
        while (!isSpaceChar(c)); return res * sgn;
    }

    public void readInt(int[] A){
        for(int i=0;i<A.length;i++)
            A[i] = readInt();
    }

    public long readLong() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        long res = 0;
        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        }
        while (!isSpaceChar(c));
        return res * sgn;
    }

    public void readLong(long[] A){
        for(int i=0;i<A.length;i++)
            A[i] = readLong();
    }

    public double readDouble() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        double res = 0;
        while (!isSpaceChar(c) && c != '.') {
            if (c == 'e' || c == 'E')
                return res * Math.pow(10, readInt());
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        }
        if (c == '.') {
            c = read();
            double m = 1;
            while (!isSpaceChar(c)) {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, readInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                m /= 10;
                res += (c - '0') * m;
                c = read();
            }
        }
        return res * sgn;
    }

    public char[] readCharA(){
        return readString().toCharArray();
    }

    public String readString() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));
        return res.toString();
    }

    public boolean isSpaceChar(int c) {
        if (filter != null)
            return filter.isSpaceChar(c);
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public String next() {
        return readString();
    }

    public interface SpaceCharFilter {
        public boolean isSpaceChar(int ch);
    }

}
			   			   							  	   	 	 	