#include<bits/stdc++.h>
#define rep(i,l,r) for(reg int i = l;i<=r;++i)
#define per(i,l,r) for(reg int i = r;i>=l;--i)
#define G(u) for(int i = h[u];~i;i=ne[i])
#define LL long long
#define reg register
#define IT iterator
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
using namespace std;
const int N = 1e5;
const int mod = 1e9+7;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const string name = "";
const bool is_file = 0;
void iput(LL x){printf("%lld",x);}
void iput(int x){printf("%d",x);}
void iput(char c){putchar(c);}
void iput(char c[]){printf("%s",c);}
void iput(string s){printf("%s",s.c_str());}
LL inline read(){
LL res = 0,f = 1;char c = getchar();
while(c<'0'||c>'9')f=c=='-'?-1:1,c=getchar();
while(c>='0'&&c<='9')res=res*10+(c^'0'),c=getchar();
return res*f;
}
struct node{
int a,b;
node(int A = 10,int B = 10){a=A,b=B;}
node operator<(const node&A)const{
;
}
node operator+(const node&A)const{
;
}
};
namespace Subtask_1{
void solve(){
;
}
};
int main(){
if(is_file)
freopen((name+".in").c_str(),"r",stdin),
freopen((name+".out").c_str(),"w",stdout);
Subtask_1::solve();
}