#pragma GCC optimize("Ofast","unroll-loops","inline")
#include<bits/stdc++.h>
#define ll long long
//#define int ll
#define pb push_back
#define pii pair<int,int>
#define MP make_pair
#define fi first
#define se second
using namespace std;
const int N=5e5+10,M=1e6+10,mod=998244353;
int n,X[N],Y[N];
int ans[N];
int p[N];
set<pii> st;
multiset<int> s;
inline bool cmp(int a,int b){return X[a]!=X[b]?X[a]>X[b]:Y[a]>Y[b];}
bool solve(){
	for(int i=0;i<2*n;i++) p[i]=i;
	sort(p,p+2*n,cmp);
	for(int i=0;i<2*n;i++){
		int v=p[i];
		if(v<n){
			auto w=st.lower_bound(MP(Y[v],0));
			if(w==st.end()) return 0;
			int t=(*w).se;
			ans[v]=t;ans[t]=v;
			st.erase(w);
		}
		else st.insert(MP(Y[v],v));
	}
	for(int i=0;i<2*n;i++){
		int u=p[i],v=ans[u];
		if(u<n) s.erase(s.find(Y[u])),s.erase(s.find(Y[v]));
		else{
			if(Y[u]<Y[v]) swap(u,v);
			auto w=s.lower_bound(Y[u]);
			if(w!=s.begin()){
				--w;
				if((*w)>Y[v]) return 0;
			}
			s.insert(Y[u]);s.insert(Y[v]);
		}
	}
	
	return 1;
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=0;i<n;i++) cin>>X[i]>>Y[i],X[i]*=2,Y[i]*=2;
	for(int i=n;i<2*n;i++)cin>>X[i]>>Y[i],X[i]*=2,Y[i]*=2,X[i]--,Y[i]--;
	if(!solve()) return cout<<"No\n",0;
	else{
		cout<<"Yes\n";
		for(int i=0;i<n;i++) cout<<ans[i]-n+1<<'\n';
	}
	return 0;
}