#include<bits/stdc++.h>
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ "="),debug_helper::debug(__VA_ARGS__),D("\n")
#include"/home/xay5421/debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define each(x,v) for(auto&x:v)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
template<class T>void rd(T&x){int f=0,c;while(!isdigit(c=getchar()))f^=!(c^45);x=(c&15);while(isdigit(c=getchar()))x=x*10+(c&15);if(f)x=-x;}
template<class T>void pt(T x,int c=-1){if(x<0)putchar('-'),x=-x;if(x>9)pt(x/10);putchar(x%10+48);if(c!=-1)putchar(c);}
using namespace std;
using LL=long long;
using ULL=unsigned long long;
const int N=400005,INF=0X3F3F3F3F;
int n,ans[N];
vector<int>vx;
struct node{
	int x,y,id;
}a[N];
struct cmp{
	bool operator()(const int&x,const int&y)const{
		if(a[x].x!=a[y].x)return a[x].x<a[y].x;
		if(a[x].y!=a[y].y)return a[x].y<a[y].y;
		return x<y;
	}
};
struct segtree{
	int mx[N<<2],tg[N<<2];
	segtree(){
		memset(mx,192,sizeof(mx));
		memset(tg,192,sizeof(tg));
	}
	
}sgt;
vector<tuple<int,int,int> >vec[N];
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	rd(n);
	rep(i,1,n){
		rd(a[i].x),rd(a[i].y),a[i].id=i;
	}
	rep(i,n+1,n+n){
		rd(a[i].x),rd(a[i].y),a[i].id=i;
	}
	rep(i,1,n+n)vx.pb(a[i].x);
	sort(vx.begin(),vx.end()),vx.erase(unique(vx.begin(),vx.end()),vx.end());
	rep(i,1,n+n)a[i].x=lower_bound(vx.begin(),vx.end(),a[i].x)-vx.begin()+1;
	sort(a+1,a+n+n+1,[&](node u,node v){return u.y<v.y;});
	set<int,cmp>S;
	for(int i=1,j;i<=n+n;i=j){
		j=i+1;
		while(j<=n+n&&a[i].y==a[j].y)++j;
		vector<tuple<int,int,int> >st;
		vector<pair<int,int> >all;
		rep(k,i,j-1)if(a[k].id>n){
			a[0].x=a[k].x;
			a[0].y=~INF;
			auto it=S.lower_bound(0);
			if(it!=S.begin()){
				--it;
				node u=a[*it];
				ans[u.id]=a[k].id-n;
				S.erase(it);
			}else{
				puts("No");
				exit(0);
			}
		}
		rep(k,i,j-1)if(a[k].id<=n){
			S.insert(k);
		}
	}
	sort(a+1,a+n+n+1,[&](node lhs,node rhs){return lhs.id<rhs.id;});
	rep(i,1,n){
		vec[a[i].x].eb(a[i].y,a[ans[i]+n].y,1);
		vec[a[ans[i]+n].x].eb(a[i].y,a[ans[i]+n].y,-1);
	}
	multiset<int>T;
	rep(x,1,n){
		for(auto&u:vec[x]){
			if(get<2>(u)==-1)		
			{
				T.erase(T.find(get<0>(u)));
				T.erase(T.find(get<1>(u)));
			}
		}
		for(auto&u:vec[x]){
			if(get<2>(u)==1){
				auto it=T.upper_bound(get<0>(u));
				if(it!=T.end()&&*it<get<1>(u)){
					puts("No");
					exit(0);
				}
			}
		}
		for(auto&u:vec[x]){
			if(get<2>(u)==1){
				T.insert(get<0>(u));
				T.insert(get<1>(u));
			}
		}
	}
	puts("Yes");
	rep(i,1,n)printf("%d\n",ans[i]);
	return 0;
}