Untitled

//
// Created by Richard on 15/10/2022.
//
#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int main() {
    int min_ri = 0, min_rval = 10000000;
    int max_li = 0, max_lval = 0;

    int n;
    cin >> n;
    vector<pair<int, int>> si;
    int temp, temp2;
    for (int i = 0; i < n; i++) {
        cin >> temp >> temp2;
        si.push_back({temp, temp2});
    }

    for (int i = 0; i < n; i++) {
        if(si[i].first > max_lval) {
            max_lval = si[i].first;
            max_li = i+1;
        }

        if(si[i].second < min_rval) {
            min_rval = si[i].second;
            min_ri = i+1;
        }
    }


    for (int i = 0; i < n; i++) {
        if(si[i].second > max_lval) {
            cout << "No" << " " << i + 1 << " " << max_li;
            return 0;
        }

        if(si[i].first > min_rval) {
            cout << "No" << " " << i + 1 << " " << min_ri;
            return 0;
        }
    }

    cout << "Yes";
}