#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int INF = INT_MAX;
const long long INFLL = (long long)1e18;
const double PI = acos(-1.0);
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
const int N = (int)2e5 + 5;
const int P = 1 << 18;
const int dx[] = {1, 1, 1, -1, -1, -1, 0, 0};
const int dy[] = {1, -1, 0, 1, -1, 0, 1, -1};
int n, xa, xb, xc, ya, yb, yc;
int use[1005][1005];
inline bool ok(int x, int y) { return x >= 1 && y >= 1 && y <= n && x <= n; }
void yeah() {
  cout << "YES\n";
  exit(0);
}
void go(int x, int y) {
  use[x][y] = 1;
  for (int i = 0; i < 8; i++) {
    int nx = x + dx[i];
    int ny = y + dy[i];
    if (ok(nx, ny)) {
      if (nx == xc && ny == yc) {
        yeah();
      }
      if (use[nx][ny] == 1) continue;
      if (nx == xa || ny == ya) {
        continue;
      }
      if (nx - xa == ny - ya) continue;
      go(nx, ny);
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cout.setf(ios::fixed | ios::showpoint);
  cout.precision(8);
  cin >> n >> xa >> ya >> xb >> yb >> xc >> yc;
  go(xb, yb);
  cout << "NO\n";
  return 0;
}
