#include <bits/stdc++.h>
#define ll long long
#define PII pair<int,int>
#define mp(a,b) make_pair(a,b)
using namespace std;
template<typename T>void read(T &x)
{
    T f=1;x=0;char s=getchar();
    while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
    while(s>='0'&&s<='9') {x=x*10+s-'0';s=getchar();}
    x*=f;
}
template<typename T>void print(T x)
{
    if(x<0) putchar('-'),x=-x;
    if(x>9) print(x/10);
    putchar(x%10+'0');
}
struct node{
	int x,y;
	node(){}
	node(int X,int Y){x=X,y=Y;}
}P[3005];
bool vis[3005];
bool cmp(node a,node b){return a.x!=b.x?a.x<b.x:a.y>b.y;}
int main() {
	int T,n,Case=1; T=1;
	while(T--)
	{
		puts("Yes");
		read(n);
		for(int i=1;i<=n;i++) read(P[i].x),read(P[i].y),vis[i]=false;
		sort(P+1,P+1+n,cmp);
		// for(int i=1;i<=n;i++) cerr<<P[i].x<<" "<<P[i].y<<endl;
		// if(Case==23)
		// {
		// 	cerr<<n<<endl;
		// 	for(int i=1;i<=n;i++) cerr<<P[i].x<<" "<<P[i].y<<endl;
		// }
		for(int i=1;i<=n;i++)
		{
			if(vis[i]) continue;
			int X1=P[i].x,Y1=P[i].y;
			int X2=114,Y2=514,pos2=n+1;
			for(int j=i+1;j<=n;j++) if(!vis[j]) {pos2=j; X2=P[pos2].x; Y2=P[pos2].y;break;}
			if(X1==X2) printf("%d %d %lld %lld\n",X1,Y2,1ll*X1-2000000000ll,1ll*Y2+2000000000ll),vis[i]=vis[pos2]=true;
			else
			{
				int X3=P[i+2].x,Y3=P[i+2].y,pos3=n+1;
				for(int j=pos2+1;j<=n;j++) if(!vis[j]) {pos3=j; X3=P[pos3].x; Y3=P[pos3].y;break;}
				while(Y3>=Y1&&pos3<=n&&X2==X3)
				{
					// if(i==93)
					// {
					// 	cerr<<i<<" "<<pos2<<" "<<pos3<<endl;
					// }
					if(Y3!=Y1||X3-(Y2-Y3)>=X1)
					{
						printf("%.1f %d %.1f %d\n",X3-(Y2-Y3)+0.1,Y2,X3+0.1,Y3);
						vis[pos2]=vis[pos3]=true;int Tmpp=pos3;pos2=pos3=n+1;
						for(int j=Tmpp+1;j<=n;j++) if(!vis[j]) {pos2=j; X2=P[pos2].x; Y2=P[pos2].y;break;}
						for(int j=pos2+1;j<=n;j++) if(!vis[j]) {pos3=j; X3=P[pos3].x; Y3=P[pos3].y;break;}
					}
					else break;
				}
				if(Y1==Y3&&X2==X3)
				{
					printf("%d %d %d %d\n",X1,Y1,X3,Y1+(X3-X1));
					vis[i]=vis[pos3]=true;
				}
				else if(pos3>n||Y3<Y1||X2!=X3)
				{
					printf("%lld %lld %lld %lld\n",1ll*max(X1,X2),1ll*min(Y1,Y2),1ll*max(X1,X2)-2000000000ll,1ll*min(Y1,Y2)+2000000000ll);
					vis[i]=vis[pos2]=true;
				}
			}
		}
		Case++;
	}
	return 0;
}