//#include "werewolf.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define pb push_back
#define sz(x) (int)x.size()
#define F first
#define S second
const int MAXN=2e5+10;
const int inf=1e8;
typedef pair<int,int> pii;
int n,pai[MAXN];
vector<int> g[MAXN];
bool ok,mark[MAXN][2];
int find(int x){
return x==pai[x]?x:pai[x]=find(pai[x]);
}
void merge(int a,int b){
g[a].pb(b),g[b].pb(a);
a=find(a),b=find(b);
pai[a]=b;
}
void dfs(int x,int l){
mark[x][1]=1;
for(auto u:g[x]){
if(mark[u][1] || u<l) continue;
dfs(u,l);
}
}
void dfs1(int x,int l,int r){
mark[x][0]=1;
if(x>=l && !mark[x][1]) dfs(x,l);
for(auto u:g[x]){
if(mark[u][0]) continue;
if(u<=r) dfs1(u,l,r);
}
}
std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y,
std::vector<int> S, std::vector<int> E, std::vector<int> L, std::vector<int> R){
n=N;
vector<pii> edges;
fall(i,0,sz(X)-1){
edges.pb({max(X[i],Y[i]),min(X[i],Y[i])});
}
sort(all(edges));
fall(i,0,n-1) pai[i]=i;
for(auto [a,b]:edges) {
if(find(a)!=find(b)){
merge(a,b);
}
}
vector<int> ans(sz(R));
fall(i,0,sz(L)-1){
ok=0;
fall(j,0,n-1) mark[j][0]=mark[j][1]=0;
dfs1(E[i],L[i],R[i]);
ans[i]=mark[S[i]][1];
}
return ans;
}
