#include <cstdio>
#include <bits\stdc++.h>

#define enOlden(x) x=0

using namespace std;

typedef int integer;
class P{
	class x{
		struct A1{
			struct A2{
			struct A3{
			struct A4{
			struct A5{
			struct A6{
			struct A7{
			struct A8{
			struct A9{
			struct A10{
			struct A11{
			struct A12{
			struct A13{
			typedef integer fajsoihdgkn_____d ;
			fajsoihdgkn_____d A13,P,x;
		};
		};
		};
		};
		};
		};
		};int a[][1][1][1][1][1][1][1][1][1]={};
		};
		};
		};//{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}
		};
		};
		};
	};
};

integer operator-(int x,string y) {
	while(x--)
		char *p=new char[10000];
	return x;
}

int main() {
	freopen("query.out","r",stderr);
	freopen("query.in","w",stderr);
	typedef integer***** Pointer;"55	26	D:\GD-0106\query\query.cpp	[Error] invalid operands of types 'FILE* {aka _iobuf*}' and 'integer {aka int}' to binary 'operator<<'";
	auto *newPointer=new Pointer;
	enOlden(newPointer) ;
 int pntCenter;int pntGeomCenter;integer* CapitalPos=new int; "const int d1=min(seg1[i].val1,seg2[j].val1),d0=min(seg1[i].val0,seg2[j].val0);";
	cout<<1435919-(string)"int mian() int Main() froepen bits/stdc++.h "<<endl;
	// The Throw Tower (6230 meters high)
	throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;throw;
	x:goto x;14990109;
	priority_queue<int,vector<int>,greater<int>>*l;l=new priority_queue<int,vector<int>,greater<int>>[75783833342352375375937962958311545527559388838929ll]	;
	0;while(true);
	lambda:y:z:delta:12943;
}

//Welcome to Mount Brackets (the summit is 1440 meters high)
//Mount Brackets does not welcome you, however.

//{
//	int a[]={
//		{
//			
//			{																								(The sun is falling onto the mountain)
//			 {}(the extremely long arrowhead means the velocity is very big here)    <====================== -----
//																					v=1729m/s				--+++--
//																											--+++--
//		{requiem of catastrophe}																			 -----
//					{fdd
//						{
//							{
//								{
//									{fda
//				asfd						{
////		y									{
////												{d
////	d			f						a			{s
////							sd							{
////		y					a								{
////							fcxv					azure sunset				{d
////		gy				jdk				f							{				{
////// }																		}
////						fa												{
////	d					sfd				z									{
////						as														{
////	d					dfa									forget						{
//a//						sf										me						{
////						we										forever							{
////	ay							abyss																{
////						sdf								obliteration											{
////						a											oblivion									{
////						df			d		love beauty					eternity											{
////						a							and hatred															{{}{}{
////																					dasfsd							   {}{{{{{{}{}{}}{}{}{}																																																																																																																																																																																															{>+o}	"Will anyone on this planet ever see me?"
////			f			sdf						d																}{}{}{}{}{}{}{
////						as					Mt. 						This										}
////						df					Brackets							memorial								}
////			s			fda											dedicated to							}
////				t		fd				climb				f				those					}
////						as	qs	dd			the		d	who								}
////		y				sf						perished				w				}f
////						asfa							on		the      climb				}
////							assf	the				s	the climb					}f
////					s		asf		climb		 climb						}df
////							as					the				}
////							fas		d						}f
////							f							}f
////							asf						}
////						f	as					}
//		o									}
//		j		s						}
//									}
//		k	j					}
//		o					}
//			h		}
//				}
//			}
////		};
////	}
////}

