#include "workshop.h"
#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
int inf=1000000007;
ll infl=1000000000000000007;
ll mod=1000000007;
ll mod1=998244353;

const int K=5,N=9999999;

int w[N];

void init()
{
	mt19937 mt;
	mt.seed(112137);
	FOR(i,0,N-1) w[i]=mt()%1000000000;
}

int morning(int x,int r)
{
	x=w[x]%N;
	if(w[x]%2==1) return w[x]%N;
	else 
	{
		int ban=-1;
		if(w[r]%2==1) ban=w[w[w[r]%N]%N]%K;
		while(w[w[x]%N]%K==ban) x=w[x]%N;
		return w[x]%N;
	}
}

int get_val(int x)
{
	int ban=w[x]%K;
	while(w[x]%K==ban) x=w[x]%N;
	return x;
}

int afternoon(int l,int x,int r) 
{
	if(w[l]%K==w[x]%K&&w[r]%K==w[x]%K) 
	{
		if(w[x]%2==1) return get_val(x);
		else
		{
			int ban=w[x]%K,ban1=-1,ban2=-1;
			if(w[l]%2==1) ban1=w[get_val(l)]%K;
			if(w[r]%2==1) ban2=w[get_val(r)]%K;
			while(w[x]%K==ban||w[x]%K==ban1||w[x]%K==ban2) x=w[x]%N;
			return x;
		}
	}
	else return x;
}

int evening(int l,int x,int r)
{
	int T=x;
	x=w[x]%K;
	l=w[l]%K;
	r=w[r]%K;
	if(l==x&&r==x) return (x+1+T%(K-3))%K;
	else if(r==x) 
	{
		if(l==(x-1+K)%K) return (x-2+K)%K;
		else return (x-1+K)%K;
	}
	else return x;
}