#include "train.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 5050;
int n, m, loop[maxn];
vector<int> g[maxn], a, r, res;
namespace s1 {
bool dfs(int v, int p) {
if(p && loop[v] && !r[v]) return true;
if(!p && loop[v] && r[v]) return true;
if(g[v].size()) return 1^dfs(g[v][0], p^1);
return false;
}
};
void solve1() {
using namespace s1;
for(int i = 0; i < n; i++) res.push_back(dfs(i, 1));
}
void solvebrt() {
}
void solvef(int f) {
}
std::vector<int> who_wins(std::vector<int> _a, std::vector<int> _r, std::vector<int> u, std::vector<int> v) {
n = a.size();
m = u.size();
a = _a, r = _r;
int ss1 = 1;
set<array<int, 2>> pr;
for(int i = 0; i < m; i++) {
if(!pr.insert({u[i], v[i]}).second) continue;
if(u[i] != v[i])
g[u[i]].push_back(v[i]);
else loop[u[i]] = 1;
ss1 &= u[i] == v[i] || v[i] == u[i]+1;
}
cout << "Here\n";
if(ss1) solve1();
else if(n < 16) solvebrt();
else solvef(count(a.begin(), a.end(), 1) == n);
return res;
}
