#define _USE_MATH_DEFIMES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include const int MOD = 1'000'000'007; const int MOD2 = 998'244'353; const int INF = 1'000'000'000; //1e9 const int NIL = -1; const long long LINF = 1'000'000'000'000'000'000; // 1e18 const long double EPS = 1E-10L; template inline bool chmax(T &a, const S &b){ if(a < b){a = b; return true;} return false; } template inline bool chmin(T &a, const S &b){ if(b < a){a = b; return true;} return false; } template inline bool exist(Container &s, const T &e){ return (s.find(e) != std::end(s)); } template inline bool inside(T x, T lx, T rx){ return (std::clamp(x, lx, rx) == x); } template inline bool inside(T x, T y, T lx, T rx, T ly, T ry){ return inside(x, lx, rx) && inside(y, ly, ry); } inline bool kadomatsu(std::vector &a){ return ((a[1] == *std::max_element(std::begin(a), std::end(a))) || (a[1] == *std::min_element(std::begin(a), std::end(a)))) && (a[0] != a[1]) && (a[1] != a[2]) && (a[2] != a[0]); } int main(){ std::vector a(3), b(3); bool okay{false}; for(auto &e: a) std::cin >> e; for(auto &e: b) std::cin >> e; for(int i{0}; i < 3; ++i){ for(int j{0}; j < 3; ++j){ std::swap(a[i], b[j]); okay |= kadomatsu(a) && kadomatsu(b); std::swap(a[i], b[j]); } } std::cout << (okay ? "Yes" : "No") << std::endl; return 0; }