#include <bits/stdc++.h>   using namespace std;   const int MX = (int)1e3 + 6;   int n, ax, ay, cx, cy, bx, by;   int dirx8[] = {0, 0, 1, -1, 1, -1, 1, -1};   int diry8[] = {1, -1, 0, 0, 1, -1, -1, 1};   bool vis[MX][MX];   void fast() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);   }   bool vaild(int &x, int &y) {     if (x < 1 || x > n || y < 1 || y > n || vis[x][y] || x == ax || y == ay ||         x + y - 1 == ax + ay - 1 || x + (n - y + 1) - 1 == ax + (n - ay + 1) - 1)       return false;     return true;   }   int main() {     cin >> n;     cin >> ax >> ay;     cin >> bx >> by;     cin >> cx >> cy;     for (int i = 1; i <= n; i++) {       for (int j = 1; j <= n; j++) {         vis[i][j] = false;       }     }     vis[bx][by] = true;     queue<pair<int, int>> q;     q.push({bx, by});     while (!q.empty()) {       pair<int, int> p = q.front();       q.pop();       if (p.first == cx && p.second == cy) {         cout <<  YES ;         return 0;       }       for (int k = 0; k < 8; k++) {         int px = p.first + dirx8[k], py = p.second + diry8[k];         if (vaild(px, py)) {           vis[px][py] = true;           q.push({px, py});         }       }     }     cout <<  NO ;     return 0;   }   