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.io.*;
import java.math.BigInteger;
import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.*;
import java.util.Map.Entry;
import java.util.regex.Pattern;

import javax.management.relation.RelationServiceNotRegisteredException;


public class hehehe {

	static int count=0;
	static int flag=0;
	static double eps=(double)1e-6;
	static long mod=(long)1e9+7;
	static int maxcount=0;
	static int index=0;
	static int end_time[]=new int[100001];
	static int bit[]=new int[100001];
	static int vis_time[]=new int[100001];
	static int flat_tree[]=new int[200001];
	static ArrayList<ArrayList<Integer>> tree=new ArrayList<>();
	static ArrayList<ArrayList<Integer>> table=new ArrayList<>();
	static int traverser[]=new int[100001];
	static int par[]=new int[100001];
	static boolean vis[]=new boolean[100001];
	static int tim = 0;

	//li, ri and index are stored in queries vector
	//in that order, as the sort function will use
	//the value li for comparison
	static ArrayList< pair1 > queries=new ArrayList<>();

	//ans[i] stores answer to ith query
	static int ans[]=new int[100001];
	static HashSet<String> hm;

	public static void main(String args[]){
		InputReader in = new InputReader(System.in);
		OutputStream outputStream = System.out;
		PrintWriter out = new PrintWriter(outputStream);
		Scanner sc=new Scanner(System.in);
		//----------My Code----------
		int[][] matrix=new int[10][10];
		
		for(int i=0;i<10;i++){
			String s=in.nextLine();
			for(int j=0;j<10;j++){
				if(s.charAt(j)=='X')
					matrix[i][j]=1;
				else if(s.charAt(j)=='O')
					matrix[i][j]=0;
				else
					matrix[i][j]=-1;
			}
			
		}
		int count=0;
		int count1=0;
		for(int i=0;i<10;i++){
			for(int j=0;j<10;j++){
					//System.out.println(i+" "+j);
					count=0;
					count1=0;
					for(int k=0;k<5;k++){
						if(i+k<10&&matrix[i+k][j]==1)
							count+=1;
						else if(i+k<10&&matrix[i+k][j]==-1){
							count1+=1;
						}
						else if(i+k>10)
						{
							count=0;
							break;
						}
					}
					if(count==4&&count1==1){
						System.out.println("YES");
						//System.out.println(i+"here3 "+j);
						return;
					}
					 count=0;
					 count1=0;
					for(int k=0;k<5;k++){
						if(j+k<10&&matrix[i][j+k]==1)
							count+=1;
						else if(j+k<10&&matrix[i][j+k]==-1){
							count1+=1;
							
						}
						else if(j+k>10)
						{
							count=0;
							break;
						}
					}
					if(count==4&&count1==1){
						System.out.println("YES");
					//	System.out.println(i+"here2 "+j);
						return;
					}
					count=0;
					count1=0;
					for(int k=0;k<5;k++){
						//System.out.println(i+"here1 "+j);
						if((i+k<10&&j+k<10)&&matrix[i+k][j+k]==1)
							count+=1;
						else if((i+k<10&&j+k<10)&&matrix[i+k][j+k]==-1){
							count1+=1;
							
						}
						else if((i+k<10||j+k<10))
						{
							count=0;
							break;
						}
					}
					if(count==4&&count1==1){
						System.out.println("YES");
					//	System.out.println(i+"here2 "+j);
						return;
					}
					
					
					count=0;
					count1=0;
					for(int k=0;k<5;k++){
						//System.out.println(i+"here1 "+j);
						if((i+k<10&&j-k>=0)&&matrix[i+k][j-k]==1)
							count+=1;
						else if((i+k<10&&j-k>=0)&&matrix[i+k][j-k]==-1){
							count1+=1;
							
						}
						else if((i+k<10||j-k>=0))
						{
							count=0;
							break;
						}
					}
					if(count==4&&count1==1){
						System.out.println("YES");
					//	System.out.println(i+"here2 "+j);
						return;
					}
					
				}
			}
		
		
		System.out.println("NO");
		
		
		
		
		//-- -------------The End----------------- 	-
		out.close();
	}
	
	static int rec(String ans,int length){
		if(length<=2){
			return 0;
		}
		else{
			
			int flag=0;
		char start=ans.charAt(0);
		for(int i=1;i<ans.length()-1;i++){
       	 if(start=='0'&&ans.charAt(i+1)=='0'){
                if(ans.charAt(i)=='0'){
                    flag=1;
                  //  System.out.println(ans.substring(0, i)+ans.substring(i+1));
                   count=count^rec(ans.substring(0, i)+ans.substring(i+1),ans.length()-1);
                }
                else if (ans.charAt(i)=='1'){
                     flag=1;
                   //  System.out.println(ans.substring(0, i)+ans.substring(i+1));
                	 count=count^rec(ans.substring(0, i)+ans.substring(i+1),ans.length()-1);
                 
                }
               
            }
       	 start=ans.charAt(i);
        }
		if(flag==0)
			return count^1;
		return count;
		}	
	}
	
	static int recursiveBinarySearch(int[] sortedArray, int start, int end, int key) {

		while (start < end) {
			int mid = start + (end - start) / 2; 
			if (key < sortedArray[mid]) {
				end=mid-1;

			} else if (key >=sortedArray[mid]) {
				start=mid+1;
			}
		}
		return (start); 
	}

	static long modulo(long a,long b,long c) {
		long x=1;
		long y=a;
		while(b > 0){
			if(b%2 == 1){
				x=(x*y)%c;
			}

			y = (y*y)%c; // squaring the base
			b /= 2;
		}
		return  x%c;
	}


	static long gcd(long x, long y)

	{
		if(x==0||y==0)
			return 0;
		long r=0, a, b;
		a = (x > y) ? x : y; // a is greater number
		b = (x < y) ? x : y; // b is smaller number
		r = b;
		while(a % b != 0)
		{
			r = a % b;
			a = b;
			b = r;
		}
		return r;
	}
	static class Pair implements Comparable<Pair> {
		int x;
		int y;
		//int i;
		Pair(int  xx,int yy){

			x=xx;
			y=yy;
			//i=ii;
		}
		@Override
		public int compareTo(Pair arg0) {

			return Integer.compare(10*x+y,10*y+x);


		}

	}
	static class pair1 implements Comparable<pair1>{
		Pair p;
		int x;
		pair1(Pair p,int x){
			this.p=p;
			this.x=x;
		}
		public int compareTo(pair1 arg0) {



			return Integer.compare(p.x, arg0.p.x);


		}

	}
	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream inputstream) {
			reader = new BufferedReader(new InputStreamReader(inputstream));
			tokenizer = null;
		}

		public String nextLine(){
			String fullLine=null;
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					fullLine=reader.readLine();
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				return fullLine;
			}
			return fullLine;
		}
		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
	}
} 