ARC031 B:埋め立て

vector<string> g_graph(10);
const int dx[] = { 0,-1,1,0 };
const int dy[] = { -1,0,0,1 };
 
void dfs(int y, int x, vector<vector<bool>>& visited) {
    visited[y][x] = true;
    for (int i = 0; i < 4; i++) {
        int ny = y + dy[i], nx = x + dx[i];
        if (ny < 0 || ny >= 10 || nx < 0 || nx >= 10) {
            continue;
        }
        if (g_graph[ny][nx] == 'x') {
            continue;
        }
        if (visited[ny][nx]) {
            continue;
        }
        dfs(ny, nx, visited);
    }
}
 
bool go(int start_y, int start_x) {
    vector<vector<bool>> visited(10, vector<bool>(10, false));
    dfs(start_y, start_x, visited);
    for (int i = 0; i < 10; i++) {
        for (int j = 0; j < 10; j++) {
            if (g_graph[i][j] == 'o' && visited[i][j] == false) {
                return false;
            }
        }
    }
    return true;
}
 
signed main() {
    for (int i = 0; i < 10; i++) {
        cin >> g_graph[i];
    }
    bool ok = false;
    for (int i = 0; i < 10; i++) {
        for (int j = 0; j < 10; j++) {
            if (go(i, j)) {
                ok = true;
            }
        }
    }
    string ans = ok ? "YES" : "NO";
    cout << ans << endl;
}