#include<bits/stdc++.h>
#define ls rt<<1
#define rs rt<<1|1
using namespace std;
const int N=2e5+10;
struct node{
    int x,y,id;
}a[N<<1];
int cmp(node x,node y){
    if(x.x!=y.x)return x.x<y.x;
    return x.y<y.y;
}
int Lx[N<<1],Ly[N<<1];
vector<int>hav[N<<1];
int t[N<<1],Y;
void add(int x,int v){
    for(;x<=Y;x+=x&-x)t[x]+=v;
}
int q(int x){
    if(!x)return 0;
    int ans=0;
    for(;x;x-=x&-x)ans+=t[x];
    return ans;
}
int q(int l,int r){
    if(l>r)return 0;
    return q(r)-q(l-1);
}
int get(int l,int r,int x){
    if(!q(1,x))return -1;
    while(l<r){
        int mid=l+r>>1;
        if(q(mid+1,r))l=mid+1;
        else r=mid;
    }
    return l;
}
int ans[N<<1];
int main(){
    int n;scanf("%d",&n);
    for(int i=1;i<=n*2;++i){
        scanf("%d%d",&a[i].x,&a[i].y);a[i].x<<=1,a[i].y<<=1;if(i>n)a[i].x--,a[i].y--;
        Lx[i]=a[i].x,Ly[i]=a[i].y,a[i].id=i;

    }
    sort(Lx+1,Lx+1+n*2),sort(Ly+1,Ly+1+n*2);
    int X=unique(Lx+1,Lx+1+n*2)-Lx-1;
    Y=unique(Ly+1,Ly+1+n*2)-Ly-1;
    for(int i=1;i<=n*2;i++){
        a[i].x=lower_bound(Lx+1,Lx+1+X,a[i].x)-Lx,a[i].y=lower_bound(Ly+1,Ly+1+Y,a[i].y)-Ly;
        // cout<<a[i].x<<" "<<a[i].y<<" "<<a[i].id<<"\n";
    }
    sort(a+1,a+n*2+1,cmp);
    for(int i=1;i<=n*2;i++){
        
        // cout<<a[i].id<<"\n";
        if(a[i].id<=n){
            hav[a[i].y].push_back(i);
            add(a[i].y,1);
        }else{
            int pos=get(1,Y,a[i].y);
            if(pos==-1){
                printf("No\n");return 0;
            }
            // cout<<a[i].id<<" "<<pos<<"\n";
            int x=hav[pos].back();hav[pos].pop_back();
            // cout<<x<<"\n";
            ans[a[i].id]=x;add(pos,-1);
            ans[a[x].id]=i;
        }
        // cout<<i<<"*\n";
    }
    if(n>=100)cout<<"*";
    multiset<int>st;
    for(int i=1;i<=2*n;i++){
        
        int x=a[i].y,y=a[ans[a[i].id]].y;
        if(n>=100&&(y==123389||x==123398)){
            cout<<a[i].x<<" "<<a[i].y<<"\n";
            cout<<a[ans[a[i].id]].x<<" "<<" "<<a[ans[a[i].id]].y<<"\n";




        }
        if(a[i].id>n)st.erase(st.find(x)),st.erase(st.find(y));
        else{
            auto it=st.upper_bound(x);
            if(it!=st.end()){
                if(*(it)<y){
                    if(n>=100)cout<<x<<" "<<y<<" "<<(*it)<<"\n";
                    printf("No\n");return 0;
                }
            }
            st.insert(x),st.insert(y);
        }
    }
    printf("Yes\n");
    for(int i=1;i<=n;i++)printf("%d\n",a[ans[i]].id-n);
    return 0;
}