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
    import java.lang.reflect.Array;
    import java.util.Scanner;
    import java.io.*;
    import java.util.*;
    import java.math.*;
    import java.lang.*;
    import static java.lang.Math.*;
    public class main implements Runnable {

        static ArrayList<Integer> adj[];
        static int co = 0, f = 0;

        static void Check2(int n) {
            adj = new ArrayList[n + 1];
            for (int i = 0; i <= n; i++) {
                adj[i] = new ArrayList<>();
            }

        }

        static void add(int i, int j) {

            adj[i].add(j);
            adj[i].add(j);
        }

        public static void main(String[] args) {
            new Thread(null, new main(), "Check2", 1 << 26).start();// to increse stack size in java
        }

        static long mod = (long) (1e9 + 7);

        public void run() {
            /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
            //Scanner in=new Scanner(System.in);

            InputReader in = new InputReader(System.in);
            PrintWriter w = new PrintWriter(System.out);


                int n=10;
                int m=10;


                String s[]=new String[10];
                char c[][]=new char[n][n];
                for(int i=0;i<n;i++){
                    s[i]=in.next();
                    c[i]=s[i].toCharArray();
                }

                boolean ans=false;
                for(int i=0;i<n;i++){

                    for(int j=0;j<n;j++){


                        if(c[i][j]=='.'){


c[i][j]='X';
                          ans=hor(c)||ver(c)||dia(c);
                          if(ans)break;
c[i][j]='.';
                        }



                    }
                    if(ans)break;


                }

                if(ans)w.println("Yes");
            else
                w.println("No");














            w.close();
        }

static boolean hor(char c[][]){

            for(int i=0;i<10;i++){
                for(int j=0;j<10;j++)
                {
                    int ce=0;


                    for(int k=j;k<10&&k<j+5;k++){

                        if(c[i][k]=='X')ce++;

                    }
                    if(ce==5)return true;




                }


            }

            return false;


}

        static boolean ver(char c[][]){

            for(int i=0;i<10;i++){
                for(int j=0;j<10;j++)
                {
                    int ce=0;


                    for(int k=j;k<10&&k<j+5;k++){

                        if(c[k][i]=='X')ce++;

                    }

                    if(ce==5)return true;




                }


            }

            return false;


        }

        static boolean dia(char c[][]){

            for(int i=0;i<10;i++){
                for(int j=0;j<10;j++)
                {
                    int ce=0;

                        int p=i;
                    for(int k=j;k<10&&k<j+5&&p<10&&p<i+5;k++,p++){

                        if(c[k][p]=='X')ce++;

                    }
                    if(ce==5)return true;

                }


            }
            for(int i=0;i<10;i++){
                for(int j=0;j<10;j++)
                {
                    int ce=0;

                    int p=i;
                    for(int k=j;k>=0&&k>j-5&&p<10&&p<i+5;k--,p++){

                        if(c[k][p]=='X')ce++;

                    }
                    if(ce==5)return true;

                }


            }


            return false;


        }

        static class pair   {
        int x,y;

        pair(int a,int b){

            x=a;
            y=b;
                   }
            public int hashCode() {
                return this.x + this.y* 31;
            }
            public boolean equals(Object o) {
                if (o == null) {
                    return false;
                }
                if (o instanceof pair) {
                    pair that = (pair)o;
                    return this.x == that.x && this.y == that.y;
                }
                return false;
            }



        }

        static  void dfs(int i,int v[],int v2[],int edge){


            if(v[i]==1)return ;
            v[i]=1;
            v2[i]=1;
            Iterator <Integer> it=adj[i].iterator();
            while(it.hasNext()){
                int q=it.next();
                dfs(q,v,v2,edge+1);
            }





        }


        static long power(long x,long y){
            if(y==0)return 1%mod;
            if(y==1)return x%mod;


            long res=1;
            x=x%mod;
            while(y>0){


                if((y%2)!=0){
                    res=(res*x)%mod;
                }


                y=y/2;
                x=(x*x)%mod;
            }


            return res;



        }


        static  int gcd(int a,int b){

            if(b==0)return a;
            return gcd(b,a%b);
        }

        static  void sev(int a[],int n){

            for(int i=2;i<=n;i++)a[i]=i;
            for(int i=2;i<=n;i++){

                if(a[i]!=0){
                    for(int j=2*i;j<=n;){

                        a[j]=0;
                        j=j+i;
                    }
                }

            }

        }


        static class node{

            int y;
            int val;

            node(int a,int b){

                y=a;
                val=b;

            }


        }

        static 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 String nextLine()
            {
                BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
                String str = "";
                try
                {
                    str = br.readLine();
                }
                catch (IOException e)
                {
                    e.printStackTrace();
                }
                return str;
            }
            public int nextInt()
            {
                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 long nextLong()
            {
                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 double nextDouble()
            {
                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, nextInt());
                    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, nextInt());
                        if (c < '0' || c > '9')
                            throw new InputMismatchException();
                        m /= 10;
                        res += (c - '0') * m;
                        c = read();
                    }
                }
                return res * sgn;
            }

            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);
            }
        }







    }