/**
* Modified by Noivelist,
* Luogu:https://www.luogu.com.cn/user/700335
* Marsoj:http://marsoj.com/user/252
* “倘若梦境醒来,执念破去,我们再谈救赎”
* Working on Project: [ ]
**/
#include<bits/stdc++.h>
using namespace std;
#define int long long
//#define int unsigned long long
#define i1 ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define i2 exit(0)
#define Void void
#define For(a,b,c) for(int a=b;a<=c;a++)
#define deFor(a,b,c) for(int a=b;a>=c;a--)
#define i4 puts("")
#define i3 putchar(' ')
#define fi first
#define se second
#define pb push_back
#define mkpr make_pair
#define pii pair<int,int>
#define mii map<int,int>
#define vi vector<int>
#define qi queue<int>
#define pqi priority_queue<int>
namespace Noivelist{
inline void R(int &x){
x=0;int p=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')p=-1;ch=getchar();}
while(isdigit(ch)){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
x*=p;}
inline void W(int x){
if(x<0){putchar('-');x*=-1;}
if(x<10){putchar(x+48);return;}
W(x/10);putchar(x%10+48);
return;}
inline void W_arg(int a[],int n){
for(int i=1;i<=n;W(a[i]),putchar(' '),i++);
puts("");return;}
template<typename T>
inline bool Max(T a,T b){
if(a<b){a=b;return true;}
else return false;}
template<typename T>
inline bool Min(T a,T b){
if(a>b){a=b;return true;}
else return false;}
template<typename T>
inline void R2(T &a,T &b){
R(a);R(b);
}
template<typename T>
inline void R3(T &a,T &b,T &c){
R(a);R(b);R(c);
}
}
using namespace Noivelist;
const int N=
main(Void){
i1;
i2;
}