#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int n, m, r;
int field[100][100];
int d[100][100];
bool seen[100][100];
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
int dfs(int x, int y) {
  seen[x][y] = true;
  r++;
  for (int i = 0; (i) < (int)(4); i++) {
    int nx = x + dx[i];
    int ny = y + dy[i];
    if (nx < 0 || nx >= m || ny < 0 || ny >= n) continue;
    if (seen[nx][ny]) continue;
    if (field[nx][ny] == 0) continue;
    if (d[nx][ny] != 1e9) continue;
    dfs(nx, ny);
  }
  return r;
}
int main() { cout << "YES" << endl; }
