#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "E:/OI/normal/templates/debug.h"
#else
#define dbg(...) (void)0
#define msg(...) (void)0
#endif
#define ll long long
#define endl '\n'
#define PB emplace_back
#define PPB pop_back
#define MP make_pair
#define ALL(Name) Name.begin(),Name.end()
#define PII pair<int,int>
#define VI vector<int>
#define GI greater<int>
#define fi first
#define se second

const int N=200005;
int n;
struct poi
{
	int x,y,id;
}lef[N],rig[N];
bool cmp1(poi &x,poi &y)
{
	return x.y==y.y?x.x<y.x:x.y<y.y;
}
bool cmp2(poi &x,poi &y)
{
	return x.x==y.x?x.y<y.y:x.x<y.x;
}
int ans[N];
struct op
{
	int tim,l,r,typ;
	bool add;
	bool operator<(const op &rhs)const
	{
		if(tim!=rhs.tim)return tim<rhs.tim;
		if(add!=rhs.add)return add<rhs.add;// delete first
		if(add)return r-l+1>rhs.r-rhs.l+1; // add larger ones first
		return r-l+1<rhs.r-rhs.l+1;		   // remove smaller ones first
	}
}f[N<<1];
struct fajlkdjfklsad{bool operator()(poi x,poi y){return cmp2(x,y);}};

struct node
{
	VI cov;
	node *l,*r,*fa;
}*root=new node();
#define mid (l+r>>1)
#define rmd (mid+1)
int t=-1;
int lst(node *x)
{
	if(!x->cov.empty())return x->cov.back();
	return lst(x->fa);
}
void add(unsigned L,unsigned R,int id,node *cur=root,unsigned l=0,unsigned r=2e9+7)
{
	if(L==l&&R==r)
	{
		if(!~t)t=lst(cur);
		if(t!=lst(cur))puts("No"),exit(0);
		cur->cov.PB(id);
		return;
	}
	if(L<=mid)
	{
		if(!cur->l)(cur->l=new node())->fa=cur;
		add(L,min(R,mid),id,cur->l,l,mid);
	}
	if(R>=rmd)
	{
		if(!cur->r)(cur->r=new node())->fa=cur;
		add(max(L,rmd),R,id,cur->r,rmd,r);
	}
}
bool chk(node *cur)
{
	if(!cur)return 1;
	if(!cur->cov.empty())return 0;
	return chk(cur->l)&&chk(cur->r);
}
void del(unsigned L,unsigned R,int id,node *cur=root,unsigned l=0,unsigned r=2e9+7)
{
	if(L==l&&R==r)
	{
		if(cur->cov.back()!=id)puts("No"),exit(0);
		cur->cov.pop_back();
		return;
	}
	if(L<=mid)del(L,min(R,mid),id,cur->l,l,mid);
	if(R>=rmd)del(max(L,rmd),R,id,cur->r,rmd,r);
}

int main()
{
	ios::sync_with_stdio(false),cin.tie(nullptr);
//	int _;cin>>_;while(_--)

	cin>>n;
	for(int i=1;i<=n;i++)cin>>lef[i].x>>lef[i].y,lef[i].x+=1e9,lef[i].y+=1e9,lef[i].id=i;
	for(int i=1;i<=n;i++)cin>>rig[i].x>>rig[i].y,rig[i].x+=1e9,rig[i].y+=1e9,rig[i].id=i;
	sort(lef+1,lef+n+1,cmp1);
	sort(rig+1,rig+n+1,cmp1);
	set<poi,fajlkdjfklsad>st;
	for(int i=1,j=1;i<=n;i++)
	{
		while(j<=n&&lef[j].y<rig[i].y)st.insert(lef[j++]);
		auto it=st.upper_bound(poi{rig[i].x-1,INT_MAX,-114514});
		if(it==st.begin())return puts("No"),0;
		it--;
		ans[it->id]=rig[i].id;
		assert(it->x<rig[i].x&&it->y<rig[i].y); 
		f[2*i-1]={it->x,it->y,rig[i].y-1,i,1},f[2*i]={rig[i].x,it->y,rig[i].y-1,i,0};
		st.erase(it);
	}
	sort(f+1,f+(n<<1)+1);
	root->cov.PB(0);
	for(int i=1;i<=n<<1;i++)
		if(f[i].add)
		{
			t=-1;
			add(f[i].l,f[i].r,f[i].typ);
		}
		else del(f[i].l,f[i].r,f[i].typ);
	cout<<"Yes\n";
	for(int i=1;i<=n;i++)cout<<ans[i]<<endl;
	
	return 0;
}