#include <bits/stdc++.h>
using namespace std;
const int n = 10, dir[4][2] = {{1, 0}, {0, 1}, {1, -1}, {1, 1}};
int main() {
  char b[n][n];
  for (int i = 0; i < 10; i++)
    for (int j = 0; j < n; j++) scanf(" %c", &b[i][j]);
  bool found = false;
  for (int i = 0; !found && i < n; i++)
    for (int j = 0; !found && j < n; j++)
      for (int k = 0; k < 4; k++) {
        int p = 0, q = 0;
        for (int l = 0; l < 5; l++) {
          int x = i + dir[k][0] * l, y = j + dir[k][1] * l;
          if (x < 0 || x >= n || y < 0 || y >= n) break;
          ;
          char c = b[x][y];
          p += (c == 'X'), q += (c == '.');
        }
        if (p == 4 && q == 1) found = true;
      }
  if (found)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
