//Konrad Paluszek,University of Warsaw(former XIV LO Staszic)
//it's nice to stick a fork into an open socket
//clock says it's time to sleep
//our getppid() in heaven, hallowed by ttyname
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "sonlib.h"
#define TIME (chrono::steady_clock::now().time_since_epoch().count())
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define xfm(a,b)a##b
#define xwb(a,b)xfm(a,b)
#define _ xwb(nvj,__LINE__)
#define FOR(i,b,e)for(urs((b)+(e))i=(b);i<=(e);++i)
#define REP(i,n)for(urs(n)i=0;i<(n);++i)
#define FORD(i,b,e)for(urs((b)+(e))i=(b);i>=(int)(e);--i)
#define UNTIL(t)while(clock()<(t)*CLOCKS_PER_SEC)
#define PER(r...)for(bool _=1;_||next_permutation(r);_=false)
#define ALL(r)(r).begin(),(r).end()
#define FS(r)r.first,r.second
#define sim template<class c
#define ros return o
#define rans return ans
#define forbits(i,m)if(m)for(urs(m)i=ctz(m),i##nvj=m;i##nvj;i##nvj^=((urs(m))1<<i),i=ctz(i##nvj))
#define fordbits(i,m)if(m)for(urs(m)i=8*sizeof(m)-clz(m)-1,i##nxd=m;i##nxd;i##nxd^=((urs(m))1<<i),i=8*sizeof(m)-clz(i##nxd)-1)
#define ksets(t, m, k, n) for (t m = (((t)1 << (k)) - 1); m < ((t)1 << (n)); m = nux(m))
#define urs(r...)typename decay<decltype(r)>::type
#define hur(f,g,r)sim>int f(c a){if(sizeof(c)==16)return r;if(sizeof(c)==8)return g##ll(a);return g(a);}
#define pwq(t,i) int clz(t x){return clz<int>(x)-i;}
using namespace __gnu_pbds;using namespace std;using ll=long long;using ld=long double;using ull=unsigned long long;using pii=pair<int,int>;using pll=pair<ll,ll>;using vpii=vector<pii>;using unt=unsigned int;sim>using min_queue=priority_queue<c,vector<c>,greater<c>>;sim>using ordered_set=tree<c,null_type,less<c>,rb_tree_tag,tree_order_statistics_node_update>;hur(popc,__builtin_popcount,popc<ull>(a)+popc<ull>(a>>64))hur(ctz,__builtin_ctz,(ull)a?ctz<ull>(a):64+ctz<ull>(a>>64))hur(clz,__builtin_clz,a>>64?clz<ull>(a>>64):64+clz<ull>(a))pwq(short,16)pwq(uint16_t,16)pwq(char,24)pwq(int8_t,24)pwq(uint8_t,24)sim,class N>bool mini(c&o,const N&h){if(o>h)ros=h,1;return 0;}sim,class N>bool maxi(c&o,const N&h){if(o<h)ros=h,1;return 0;}sim,class n>using gyv=c;
#ifdef LOCAL
#define loc(r...)r
#define onl(r...)
#define azm(r)sim,class n,class l,class...v>bool emz1(const r<c,n,v...>&o,l b){ros.count(b);}sim,class n,class l,class...v>const n&emz2(const r<c,n,v...>&o,l b){ros.find(b)->second;}
#define oor >ostream&operator<<(ostream&o,
#define debug(c...)::dor(1,vqx(__LINE__,__FUNCTION__,__PRETTY_FUNCTION__),c)
#define rcu m);}g(+)g(-)g(*)g(/)g(%)g(<<)g(>>)g(^)g(|)g(&)g(>=)g(<=)g(>)g(<)g(!=)g(==)
#define zub(h,t,n...)class N>auto operator h(n u)->nep<urs(t)>{return ngy(t,
#define g(o)template<zub(o,v o u,N)tfj(bte(*this))+" " #o " "+tfj(bte(u)),m);}
sim>gyv<int,typename c::value_type>dud(int x);sim>char dud(...);struct kav;sim>struct lfu;sim> struct jat;struct kav{static const int d=0;};sim>struct lfu{static const int d=jat<typename c::value_type>::d + 1;};sim>struct jat{static const int d=conditional<sizeof(dud<c>(0))==1,kav,lfu<c>>::type::d;};sim,class n>struct jat<pair<c,n>>{static const int d=jat<c>::d>jat<n>::d?jat<c>::d:jat<n>::d;};template<>struct jat<string>{static const int d=0;};
vector <pair <string, string> > repl = {{"std::", ""}, {"__debug::", ""}, {"long long unsigned int", "ull"}, {"long unsigned int", "size_t"}, {"unsigned int", "unt"}, {"long long int", "ll"}, {"vector<pair<int, int> >", "vpii"}, {"pair<int, int>", "pii"}, {"pair<long double, long double>", "pdd"}, {"long double", "ld"}};
string xif(string r) {string o;int d=0;for(char c:r) if(c=='[')d++;else if(c==']')d--;else if(d)o+=c;for(auto p:repl)while(true){unt f=o.find(p.first);if(f<o.size())o.replace(f,p.first.size(),p.second);else break;}if(o.size())o=" "+o;ros;}
sim>c&lum(c&o){ros;}int lum(int8_t o){ros;}unt lum(uint8_t o){ros;}int uuv=6;void set_pre(int x){uuv=x;}sim>struct yda{c x;ll p,q,r,s;};sim>yda<typename std::decay<c>::type>nyb(c x,ll p,ll q,ll r,ll s){return{x,p,q,r,s};}azm(map)azm(unordered_map)sim>bool emz1(const c&a,ll o){ros>=0&&o<(ll)a.size();}sim>auto emz2(const c&o,ll x)->decltype(o[x]){ros[x];}sim>bool emz1(c*a,ll o){ros>=0;}sim>c&emz2(c*o,ll b){ros[b];}template<size_t n>bool emz1(const bitset<n>&,ll o){ros>=0&&o<(ll)n;}template<size_t n>int emz2(const bitset<n>&o,ll b){ros[b];}string tfj(string o){for(char x:o)if(x=='=')return"("+o+")";ros;}string vqx(int l,string f,string pf){stringstream o;o<<"\033[1;"<<30+l%8<<"m"<<f<<xif(pf)<<"#"<<l<<": \033["<<30+l%7+(l%7>=l%8)<<"m";ros.str();}ostream&operator<<(ostream&o,__int128 x){int D[50],c=0;if(x<0)o<<"-",x=-x;do{D[c++]=x%10;x/=10;}while(x);while(c)o<<D[--c];ros;}ostream&operator<<(ostream&o,__uint128_t x){int D[50],c=0;do{D[c++]=x%10;x/=10;}while(x);while(c)o<<D[--c];ros;}ostream&operator<<(ostream&o,__float128 x){ros<<(ld)x;}sim,class N oor pair<c,N>u){ros<<"<"<<lum(u.first)<<", "<<lum(u.second)<<">";}sim,typename=typename enable_if<!is_same<c,string>::value,urs(c().end())>::type oor c u){int q=0;o<<"{";for(auto e:u)o<<", "+2*!q++<<lum(e);ros<<"}_"<<q;}void dor(bool x){cerr<<dec<<"\033[0m"<<endl;}sim,class...N>void dor(int w,c x,N...y){cerr<<setprecision(uuv)<<boolalpha<<x<<"; "+2*w;dor(0,y...);}sim>string bte(c u){stringstream o;o<<setprecision(uuv)<<boolalpha<<lum(u);ros.str();}sim>struct nep;sim>c yyo(nep<c>);sim>nep<c>ngy(c,string,int m=0);sim>c yyo(c o){ros;}sim>struct nep{c v;string d;int m;nep<c>mask(){return ngy(v,d,1);}template<zub([],v[yyo(u)],N)d+"["+bte(u)+"]",rcu};sim>nep<c>ngy(c v,string d,int m){return nep<c>{v,d,m};}sim>c yyo(nep<c>o){ros.v;}sim>int uhn(c){return 0;}sim>int uhn(nep<c>o){ros.m;}
#undef g
#define ckx(o)template<zub(o,o yyo(u),nep<N>)#o+tfj(bte(u)),u.m);}
#define g(o)sim,zub(o,yyo(p)o u.v,c p,nep<N>)tfj(bte(p))+" " #o " "+tfj(bte(u)),uhn(p)+u.m);}
#define ccy(r...)sim>class enable_if<r is_integral<c>::value,string>::type ema(c u){
#define qel(t)sim,class d,class...e oor t<c,d,e...>r){ros<<*(d*)&r;}
qel(queue)qel(priority_queue)qel(stack)ccy(!)return bte(u);}ccy()stringstream o;o<<"[";int q=0;forbits(i,u)o<<", "+2*!q++<<lum(i);ros.str()+"]";}sim>string bte(nep<c>o){string v=(o.m?ema(o.v):bte(o.v));if(v==o.d)ros.d;ros.d+" = "+v;}sim oor nep<c>m){ros<<bte(rcu sim>nep<c>ngy(nep<c>o,string d="",int m=0){ros;}ckx(+)ckx(-)ckx(!)ckx(~)sim oor yda<c>M){if(M.p>=M.q||M.r>=M.s)ros<<"[------]";int l=0;stringstream p;vector<vector<string>>X;vector<int>Y(M.s-M.r,1);FOR(i,M.p,M.q-1){maxi(l,(int)bte(i).size());X.emplace_back();if(emz1(M.x,i)){auto V=emz2(M.x,i);FOR(j,M.r,M.s-1){if(emz1(V,j)){auto Q=emz2(V,j);X.back().push_back(bte(Q));maxi(Y[j-M.r],(int)X.back().back().size());}else X.back().push_back("3Ju+");}}}FOR(i,M.p,M.q-1){p<<"\n"<<setw(l)<<i<<": ";if(X[i-M.p].size())FOR(j,M.r,M.s-1){if(X[i-M.p][j-M.r]=="3Ju+")REP(_,Y[j-M.r])p<<"-";else p<<setw(Y[j-M.r])<<X[i-M.p][j-M.r];p<<"; ";}}p<<"\n";ros<<p.str();}vector<string>fdn;struct bcx{bcx(){fdn.push_back("");}~bcx(){fdn.pop_back();}};void imx(string m){cerr<<m<<"STACK TRACE: "<<dec<<"\033[0m"<<endl;for(auto x:fdn)cerr<<"\t"<<x<<"\033[0m"<<endl;}void ctm(bool r){fdn.back()+="\033[m";}sim,class...n>void ctm(bool r,c x,n...y){fdn.back()+=bte(x)+("; "+2*r);ctm(0,y...);}
#undef g
#define imie(a...) ngy(a,#a)
#define imask(a...) ngy(a,#a,1)
#define ra3(u,g,c) ngy(list<urs((u)[0])>(begin(u)+yyo(g),begin(u)+yyo(c)),#u "["+bte(g)+"..."+bte(c)+")")
#define ra2(i,j)ngy(list<urs(*(i))>(i,j),"[" #i "..." #j ")")
#define zoz(a,b,c,d,e...) d
#define range(r...) zoz(r,ra3,ra2)(r)
#define arr(a, i) imie(a)[imie(i)]
#define arr2(a, i, j) imie(a)[imie(i)][imie(j)]
#define print_stack(r...)::imx(vqx(__LINE__,__FUNCTION__,__PRETTY_FUNCTION__))
#define mark_stack(r...)bcx _;::ctm(1,vqx(__LINE__,__FUNCTION__,__PRETTY_FUNCTION__),r)
#define dump(a,i,j,k,q)ngy(nyb(a,yyo(i),yyo(j),yyo(k),yyo(q)),#a "["+bte(imie(i))+".."+bte(imie(j))+")["+bte(imie(k))+".."+bte(imie(q))+")")
#else
#define loc(...)
#define onl(r...)r
#define debug(...)
#define print_stack(...)
#define mark_stack(...)
#define set_pre(...)
#endif
#define next nexT
#define prev preV
#define tree trEE
#define left lefT
#define right righT
#define div diV
#define y1 y_1
ull mix(ull o){o+=0x9e3779b97f4a7c15;o=(o^(o>>30))*0xbf58476d1ce4e5b9;o=(o^(o>>27))*0x94d049bb133111eb;ros^(o>>31);}ull SALT=0x7a14a4b0881ebf9,tqu=0x7a14a4b0881ebf9;ull my_rand(){return tqu=mix(tqu);}void my_srand(ull x){SALT=tqu=x;}const int inf = 1023400000;const ll llinf=1234567890000000000ll;
#define rand my_rand
#define srand my_srand
#define random_shuffle(r...)random_shuffle(r,[](int _){return my_rand()%_;})
sim>inline c nux(c m){if(!m)return numeric_limits<c>::max();c A=m&-m;c B=~((A-1)^m);c C=B&-B;c D=(C>>(1+ctz(A)))-1;return C|(m&~(C-1))|D;}__attribute__((no_sanitize_undefined))ll mul(ll a,ll b,ll m){ll q=a*(ld)b/m;ll o=a*b-q*m;o%=m;if(o<0)o+=m;ros;}sim>void unq(c&x){x.resize(unique(ALL(x))-x.begin());}sim>c gcd(c o,c b){while(o&&b){int x=ctz(o),y=ctz(b);if(x>y)o>>=x-y;else b>>=y-x;if(o>b)o-=b;else b-=o;}ros?o:b;}sim>c lcm(c o,c b){ros/gcd(o,b)*b;}
sim>typename enable_if<is_integral<c>::value,ull>::type my_hash(c x){
	if(sizeof(c)>8) return mix((ull)x^SALT)^mix((ull)(x>>64)^SALT);
	return mix(x^SALT);
}
template<size_t N>ull my_hash(const bitset<N>&x){
	return mix(hash<bitset<N>>()(x)^SALT);
}
sim,class n>ull my_hash(const pair<c,n>&);
sim>gyv<ull,typename c::value_type>my_hash(const c&x){
	ull o=SALT;
	for(auto&d:x)o=mix(o^my_hash(d));
	ros;
}
sim,class n>ull my_hash(const pair<c,n>&x){return mix(my_hash(x.first))^my_hash(x.second);}
sim>struct my_hasher{size_t operator()(const c&o)const{return my_hash(o);}};
sim,class m>using _un0rDer3d_M4P=loc(unordered_map)onl(cc_hash_table)<c,m,my_hasher<c>>;
#define unordered_map _un0rDer3d_M4P
string join(const vector<string>&x){stringstream ans;ans<<"\n";for(const string&c:x)ans<<c<<"\n";return ans.str();}
sim,class F>auto get(F f,c x)->decltype(f[x]){return f[x];}
sim,class F>auto get(F f,c x)->decltype(f(x)){return f(x);}
vector<string>sp(string x){vector<string>ans(1);for(char c:x){if(c=='\n')ans.emplace_back();else ans.back().push_back(c);}rans;}
sim,class F,class G>vector<string>draw_tree_rec(c t,const c*p,F s,G d){auto C=get(s,t);auto r=sp(d(t));int lr=0;for(auto&x:r)maxi(lr,(int)x.size());if(C.empty()||(p&&C==urs(C){*p})){for(auto&q:r)q.resize(lr,' ');return r;}vector<string>ans(0);int le=0;vector<int>vs;bool prev=false;for(c x:C){if(p&&x==*p)continue;auto curr=draw_tree_rec(x,&t,s,d);for(int i=ans.size();i<(int)curr.size();++i)ans.push_back(string(le,' '));if(prev){for(int i=0;i<(int)ans.size();++i)ans[i]+=' ';le++;}prev=true;for(int i=0;i<(int)curr.size();++i)ans[i]+=curr[i];for(int i=curr.size();i<(int)ans.size();++i)ans[i]+=string(curr[0].size(),' ');vs.push_back(le+curr[0].size()/2);le+=curr[0].size();}if(lr>le){int ladd=(lr-le)/2,radd=(lr-le+1)/2;for(int&x:vs)x+=ladd;for(int i=0;i<(int)ans.size();++i)ans[i]=string(ladd,' ')+ans[i]+string(radd,' ');le=lr;}int up_i=le/2;int pos=0;string bot;for(int i=0;i<le;++i){bool down=false,up=i==up_i,in=false;if(pos==(int)vs.size())in=i<up_i;else if(i==vs[pos]){in=down=true;pos++;}else if(pos==0)in=i>up_i;else if(pos==(int)vs.size())in=i<up_i;else in=true;if(up&&down)bot+='+';else if(up)bot+='^';else if(down)bot+='v';else if(in)bot+='-';else bot+=' ';}int ladd=(le-lr)/2;for(auto&q:r){q=string(ladd,' ')+q;q+=string(le-q.size(),' ');}r.push_back(bot);ans.insert(ans.begin(),ALL(r));for(int i=1;i<(int)ans.size();++i)assert(ans[i].size()==ans[0].size());rans;}
sim,class F,class G>string draw_tree(c t,F s,G d){return join(draw_tree_rec(t,(c*)0,s,d));}
sim,class F>string draw_tree(c t,F s){return draw_tree(t,s,[](c x){return bte(x);});}
sim,class F,class G>string draw_tree(c t,c p,F s,G d){return join(draw_tree_rec(t,&p,s,d));}
sim,class F>string draw_tree(c t,c p,F s){return draw_tree(t,p,s,[](c x){return bte(x);});}
#define by_parents(p,n) [&](int xwb(vsu,__LINE__)){vector<int>o;for(int _=0;_<=(n);++_)if(p[_]==xwb(vsu,__LINE__)&&_!=xwb(vsu,__LINE__))o.push_back(_);ros;}
#if !defined(LOCAL) && !defined(LOCAL2)
void AssertEdge(int x, int y) {}
void AssertNoEdge(int x, int y) {}
void AssertAt(int x) {}
void AssertOdd() {}
void AssertEven() {}
#endif
int n;
const int nax = 607;
int subtask;
struct solve_general {
	vector <int> path[nax];
	pii solution[nax];
	void mark_solution(int a, int mid, int b) {
		AssertEdge(a, mid);
		AssertEdge(mid, b);
		debug("found", imie(a), imie(mid), imie(b));
		solution[a] = {mid, b};
		solution[b] = {mid, a};
	}
	void try_mark_solution(int where) {
		if (path[where].size() == 2u) {
			mark_solution(where, path[where][0], path[where][1]);
		}
	}
	void solve() {
		const ld mul = 0.8;
		other = -1;
		memset(p, -1, sizeof(p));
		memset(solution, -1, sizeof(solution));
		pii none = {-1, -1};
		ull seed = TIME;//0x6c9703376f03a286;
		cerr << __PRETTY_FUNCTION__ << " seed = " << seed << " mul = " << mul << endl;
		debug(imie(seed));
		srand(seed);
		int where = 1;
		while (true) {
			AssertAt(where);
			AssertEven();
			if (solution[where] != none) {
				debug("great; run Dfs", arr(solution, where));
				int mid = solution[where].first;
				int opp = solution[where].second;
				p[mid] = where;
				other = opp;
				MoveProbe(mid);
				visited[mid] = true;
				dfsOdd(mid);
				return;
			}
			if (path[where].empty()) {
				vector <int> ord0;
				vector <vector <int> > ords;
				FOR(i, 1, n) if (i != where) ord0.push_back(i);
				random_shuffle(ALL(ord0));
				REP(_, n - 1) {
					ords.push_back(ord0);
					rotate(ord0.begin(), ord0.begin() + 1, ord0.end());
				}
				random_shuffle(ALL(ords));
				bool is_star = true;
				for (vector <int> ord : ords) {
					int at = -1;
					REP(i, n - 1) {
						if (MoveProbe(ord[i])) {
							at = i;
							break;
						}
					}
					if (at == -1) {
						debug("retry", imie(ord));
						MoveProbe(where);
						continue;
					}
					path[where] = vector <int>(ord.begin(), ord.begin() + at + 1);
					try_mark_solution(where);
					is_star = false;
					debug("found", arr(path, where));
					where = ord[at];
					break;
				}
				if (is_star) {
					AssertAt(where);
					AssertEven();
					assert(where == 1);
					FOR(i, 1, n) FOR(j, i + 1, n) {
						if (i == 1) AssertEdge(i, j);
						else AssertNoEdge(i, j);
					}
					Examine();
					FOR(i, 2, n) {
						MoveProbe(i);
						Examine();
						MoveProbe(1);
					}
					assert(false);
				}
			}
			else {
				assert(path[where].size() >= 3u);
				debug(imie(where));
				FOR(i, 1, n) if (!path[i].empty()) debug(arr(path, i));
				int pref = path[where].size() * mul;
				if (pref == 0) pref++;
				if (pref == (int) path[where].size() - 1) pref--;
				REP(i, pref) {
					int _ = MoveProbe(path[where][i]); assert(!_);
				}
				if (MoveProbe(path[where].back())) {
					debug("clear", arr(path, where));
					path[where].erase(path[where].begin() + pref, path[where].end() - 1);
					debug("reaching", arr(path, where));
					try_mark_solution(where);
					where = path[where].back();
				}
				else {
					vector <int> rest;
					FOR(i, 1, n) if (i != where) rest.push_back(i);
					vector <bool> did(n + 1);
					REP(i, pref) did[path[where][i]] = 1;
					did[path[where].back()] = 1;
					debug("clear", arr(path, where));
					path[where].erase(path[where].begin(), path[where].begin() + pref);
					debug("reaching", arr(path, where), "but got lost");
					try_mark_solution(where);
					random_shuffle(ALL(rest));
					sort(ALL(rest), [this](int x, int y){return (path[x].empty() ? inf : path[x].size()) < (path[y].empty() ? inf : path[y].size());});
					rest.push_back(where);
					where = -1;
					for (int x : rest)
						if (!did[x] && MoveProbe(x)) {
							where = x;
							break;
						}
					assert(where != -1);
				}
			}
		}
	}
	bool visited[nax];
	int p[nax];
	int other;
	void dfsOdd(int i) {
		debug(imie(i));
		AssertAt(i);
		AssertOdd();
		Examine();
		vector <int> neis;
		FOR(a, 1, n) if (!visited[a]) {
			assert(a != i);
			if (MoveProbe(a)) {
				neis.push_back(a);
				MoveProbe(i);
				AssertEdge(i, a);
			}
			else
				AssertNoEdge(i, a);
		}
		random_shuffle(ALL(neis));
		for (int x : neis) {
			visited[x] = true;
			p[x] = i;
		}
		debug(imie(i), imie(neis));
		for (int x : neis) {
			MoveProbe(x);
			dfsEven(x);
			MoveProbe(i);
		}
	}
	void dfsEven(int i) {
		debug(imie(i));
		AssertAt(i);
		AssertEven();
		Examine();
		int v = p[i];
		int w = p[v];
		if (w == i) w = other;
		debug(imie(i), imie(v), imie(w));
		AssertEdge(i, v);
		AssertEdge(v, w);
		vector <int> neis;
		FOR(a, 1, n) if (!visited[a]) {
			assert(a != i);
			debug("test", imie(a));
			AssertNoEdge(a, v);
			bool found_edge = false;
			int _ = MoveProbe(a); assert(!_);
			int _ = MoveProbe(v); assert(!_);
			if (MoveProbe(w)) {
				int _ = MoveProbe(a); assert(!_);
				if (MoveProbe(i))
					found_edge = true;
				else {
					if (MoveProbe(v)) {
						AssertEdge(i, v);
						AssertEdge(v, w);
						AssertEdge(w, i);
						debug("play with cycle", imie(i), imie(v), imie(w));
						int _ = MoveProbe(w); assert(!_);
						int _ = MoveProbe(i); assert(_);
					}
					else {
						int _ = MoveProbe(w); assert(_);
						int _ = MoveProbe(v); assert(!_);
						int _ = MoveProbe(i); assert(_);
					}
				}
			}
			else {
				found_edge = true;
				AssertAt(a);
				AssertOdd();
				MoveProbe(i);
			}
			AssertAt(i);
			AssertEven();
			if (found_edge) {
				AssertEdge(a, i);
				neis.push_back(a);
			}
			else
				AssertNoEdge(a, i);
		}
		random_shuffle(ALL(neis));
		for (int x : neis) {
			visited[x] = true;
			p[x] = i;
		}
		debug(imie(i), imie(neis));
		for (int x : neis) {
			MoveProbe(x);
			dfsOdd(x);
			MoveProbe(i);
		}
	}
};
struct solve_bipartite {
	vector <int> propagate[nax][2];
	int which[nax];
	int solved;
	void solve() {
		cerr << __PRETTY_FUNCTION__ << endl;
		memset(which, -1, sizeof(which));
		int where = 1;
		solved = 0;
		put(1, 0);
		while (solved < n) {
			vector <int> ord;
			FOR(i, 1, n) if (i != where) ord.push_back(i);
			random_shuffle(ALL(ord));
			ord.push_back(where);
			int at = -1;
			REP(i, n) if (MoveProbe(ord[i])) {
				at = i;
				break;
			}
			assert(at != -1);
			put(ord[at], 0);
			put(ord[at - 1], 1);
			FOR(i, 0, at - 2)
				add_less(ord[i], ord[i + 1]);
			where = ord[at];
			AssertAt(where);
		}
		FOR(i, 1, n) FOR(j, i + 1, n) {
			assert(which[i] != -1 && which[j] != -1);
			if (which[i] != which[j]) AssertEdge(i, j);
			else AssertNoEdge(i, j);
		}
		int pick[2] = {-1, -1};
		FOR(i, 1, n) pick[which[i]] = i;
		FOR(i, 1, n) {
			if (which[where] == which[i]) {
				MoveProbe(pick[!which[where]]);
				MoveProbe(i);
			}
			else {
				MoveProbe(i);
			}
			AssertAt(i);
			Examine();
			where = i;
		}
	}
	void add_less(int x, int y) {
		add_prop(1, x, y);
		add_prop(0, y, x);
	}
	void add_prop(int i, int x, int y) {
		propagate[x][i].push_back(y);
		if (which[x] == i) put(y, i);
	}
	void put(int x, int i) {
		if (which[x] == i) return;
		assert(which[x] == -1);
		solved++;
		which[x] = i;
		debug(arr(which, x), imie(solved));
		for (int v : propagate[x][i])
			put(v, i);
	}
};
struct solve_123 {
	int p[nax];
	bool visited[nax];
	void dfs(int x) {
		debug(imie(x));
		AssertAt(x);
		AssertOdd();
		assert(!visited[x]);
		Examine();
		visited[x] = true;
		vector <int> edges;
		FOR(i, 1, n)
			if (!visited[i]) {
				if (MoveProbe(i)) {
					edges.push_back(i);
					p[i] = x;
					MoveProbe(x);
				}
				AssertAt(x);
				AssertOdd();
			}
		if (!edges.empty()) {
			flip(x);
			for (int i : edges) {
				if (visited[i]) continue;
				MoveProbe(i);
				dfs(i);
				int r = MoveProbe(x);
				assert(r);
			}
			flip(x);
		}
		AssertAt(x);
		AssertOdd();
	}
	void rotate() {
		AssertAt(1);
		MoveProbe(2);
		MoveProbe(3);
		MoveProbe(1);
		AssertAt(1);
	}
	void flip(int x) {
		if (x == 1) {
			rotate();
			return;
		}
		AssertAt(x);
		vector <int> back;
		int v = x;
		while (v != 1) {
			v = p[v];
			back.push_back(v);
		}
		debug(imie(x), imie(back));
		for (int i : back)
			MoveProbe(i);
		rotate();
		reverse(ALL(back));
		for (int i : back)
			if (i != 1) MoveProbe(i);
		MoveProbe(x);
		AssertAt(x);
	}
	void solve() {
		cerr << __PRETTY_FUNCTION__ << endl;
		if (n == 3) {
			Examine();
			MoveProbe(2);
			Examine();
			MoveProbe(3);
			Examine();
			assert(false);
		}
		rotate();
		dfs(1);
	}
};
struct solve_cycle {
	pair <int, vector <int> > go[nax];
	void solve() {
		cerr << __PRETTY_FUNCTION__ << endl;
		if (n == 3) {
			Examine();
			MoveProbe(2);
			Examine();
			MoveProbe(3);
			Examine();
			assert(false);
		}
		if (n == 4) {
			Examine();
			int opp = -1;
			for (int x : vector <int> {2, 3, 4, 2})
				if (MoveProbe(x)) {
					opp = x;
					break;
				}
			AssertAt(opp);
			Examine();
			vector <int> oth;
			FOR(i, 2, 4) if (i != opp) oth.push_back(i);
			MoveProbe(oth[0]);
			Examine();
			MoveProbe(1);
			MoveProbe(oth[1]);
			Examine();
			assert(false);
		}
		int where = 1;
		int prev = -1;
		do {
			vector <int> ord;
			FOR(i, 1, n) if (i != where) ord.push_back(i);
			random_shuffle(ALL(ord));
			REP(i, n - 1) ord.push_back(ord[i]);
			debug(imie(ord));
			int at = -1;
			REP(i, 2 * (n - 1))
				if (MoveProbe(ord[i])) {
					at = i;
					break;
				}
			assert(at != -1);
			int v = ord[at];
			AssertAt(v);
			if (v == prev) {
				debug("return from", imie(v));
				for (int x : go[v].second)
					MoveProbe(x);
				AssertAt(where);
			}
			else {
				go[where] = {v, vector <int>(ord.begin(), ord.begin() + at + 1)};
				prev = where;
				where = v;
			}
			assert(at != -1);
		}
		while (where != 1);
		FOR(i, 1, n) debug(arr(go, i));
		AssertAt(1);
		do {
			REP(i, go[where].second.size()) {
				MoveProbe(go[where].second[i]);
				if (n % 2 == 0 && i == go[where].second.size() - 2)
					Examine();
			}
			Examine();
			where = go[where].first;
		}
		while (where != 1);
	}
};
int main() {
	n = GetN();
	subtask = GetSubtask();
	if (subtask == 0) solve_general().solve();
	if (subtask == 1) solve_bipartite().solve();
	if (subtask == 2) solve_123().solve();
	if (subtask == 3) solve_cycle().solve();
	assert(false);
}

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576

//Konrad Paluszek,University of Warsaw(former XIV LO Staszic)
//it's nice to stick a fork into an open socket
//clock says it's time to sleep
//our getppid() in heaven, hallowed by ttyname
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "sonlib.h"
#define TIME (chrono::steady_clock::now().time_since_epoch().count())
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define xfm(a,b)a##b
#define xwb(a,b)xfm(a,b)
#define _ xwb(nvj,__LINE__)
#define FOR(i,b,e)for(urs((b)+(e))i=(b);i<=(e);++i)
#define REP(i,n)for(urs(n)i=0;i<(n);++i)
#define FORD(i,b,e)for(urs((b)+(e))i=(b);i>=(int)(e);--i)
#define UNTIL(t)while(clock()<(t)*CLOCKS_PER_SEC)
#define PER(r...)for(bool _=1;_||next_permutation(r);_=false)
#define ALL(r)(r).begin(),(r).end()
#define FS(r)r.first,r.second
#define sim template<class c
#define ros return o
#define rans return ans
#define forbits(i,m)if(m)for(urs(m)i=ctz(m),i##nvj=m;i##nvj;i##nvj^=((urs(m))1<<i),i=ctz(i##nvj))
#define fordbits(i,m)if(m)for(urs(m)i=8*sizeof(m)-clz(m)-1,i##nxd=m;i##nxd;i##nxd^=((urs(m))1<<i),i=8*sizeof(m)-clz(i##nxd)-1)
#define ksets(t, m, k, n) for (t m = (((t)1 << (k)) - 1); m < ((t)1 << (n)); m = nux(m))
#define urs(r...)typename decay<decltype(r)>::type
#define hur(f,g,r)sim>int f(c a){if(sizeof(c)==16)return r;if(sizeof(c)==8)return g##ll(a);return g(a);}
#define pwq(t,i) int clz(t x){return clz<int>(x)-i;}
using namespace __gnu_pbds;using namespace std;using ll=long long;using ld=long double;using ull=unsigned long long;using pii=pair<int,int>;using pll=pair<ll,ll>;using vpii=vector<pii>;using unt=unsigned int;sim>using min_queue=priority_queue<c,vector<c>,greater<c>>;sim>using ordered_set=tree<c,null_type,less<c>,rb_tree_tag,tree_order_statistics_node_update>;hur(popc,__builtin_popcount,popc<ull>(a)+popc<ull>(a>>64))hur(ctz,__builtin_ctz,(ull)a?ctz<ull>(a):64+ctz<ull>(a>>64))hur(clz,__builtin_clz,a>>64?clz<ull>(a>>64):64+clz<ull>(a))pwq(short,16)pwq(uint16_t,16)pwq(char,24)pwq(int8_t,24)pwq(uint8_t,24)sim,class N>bool mini(c&o,const N&h){if(o>h)ros=h,1;return 0;}sim,class N>bool maxi(c&o,const N&h){if(o<h)ros=h,1;return 0;}sim,class n>using gyv=c;
#ifdef LOCAL
#define loc(r...)r
#define onl(r...)
#define azm(r)sim,class n,class l,class...v>bool emz1(const r<c,n,v...>&o,l b){ros.count(b);}sim,class n,class l,class...v>const n&emz2(const r<c,n,v...>&o,l b){ros.find(b)->second;}
#define oor >ostream&operator<<(ostream&o,
#define debug(c...)::dor(1,vqx(__LINE__,__FUNCTION__,__PRETTY_FUNCTION__),c)
#define rcu m);}g(+)g(-)g(*)g(/)g(%)g(<<)g(>>)g(^)g(|)g(&)g(>=)g(<=)g(>)g(<)g(!=)g(==)
#define zub(h,t,n...)class N>auto operator h(n u)->nep<urs(t)>{return ngy(t,
#define g(o)template<zub(o,v o u,N)tfj(bte(*this))+" " #o " "+tfj(bte(u)),m);}
sim>gyv<int,typename c::value_type>dud(int x);sim>char dud(...);struct kav;sim>struct lfu;sim> struct jat;struct kav{static const int d=0;};sim>struct lfu{static const int d=jat<typename c::value_type>::d + 1;};sim>struct jat{static const int d=conditional<sizeof(dud<c>(0))==1,kav,lfu<c>>::type::d;};sim,class n>struct jat<pair<c,n>>{static const int d=jat<c>::d>jat<n>::d?jat<c>::d:jat<n>::d;};template<>struct jat<string>{static const int d=0;};
vector <pair <string, string> > repl = {{"std::", ""}, {"__debug::", ""}, {"long long unsigned int", "ull"}, {"long unsigned int", "size_t"}, {"unsigned int", "unt"}, {"long long int", "ll"}, {"vector<pair<int, int> >", "vpii"}, {"pair<int, int>", "pii"}, {"pair<long double, long double>", "pdd"}, {"long double", "ld"}};
string xif(string r) {string o;int d=0;for(char c:r) if(c=='[')d++;else if(c==']')d--;else if(d)o+=c;for(auto p:repl)while(true){unt f=o.find(p.first);if(f<o.size())o.replace(f,p.first.size(),p.second);else break;}if(o.size())o=" "+o;ros;}
sim>c&lum(c&o){ros;}int lum(int8_t o){ros;}unt lum(uint8_t o){ros;}int uuv=6;void set_pre(int x){uuv=x;}sim>struct yda{c x;ll p,q,r,s;};sim>yda<typename std::decay<c>::type>nyb(c x,ll p,ll q,ll r,ll s){return{x,p,q,r,s};}azm(map)azm(unordered_map)sim>bool emz1(const c&a,ll o){ros>=0&&o<(ll)a.size();}sim>auto emz2(const c&o,ll x)->decltype(o[x]){ros[x];}sim>bool emz1(c*a,ll o){ros>=0;}sim>c&emz2(c*o,ll b){ros[b];}template<size_t n>bool emz1(const bitset<n>&,ll o){ros>=0&&o<(ll)n;}template<size_t n>int emz2(const bitset<n>&o,ll b){ros[b];}string tfj(string o){for(char x:o)if(x=='=')return"("+o+")";ros;}string vqx(int l,string f,string pf){stringstream o;o<<"\033[1;"<<30+l%8<<"m"<<f<<xif(pf)<<"#"<<l<<": \033["<<30+l%7+(l%7>=l%8)<<"m";ros.str();}ostream&operator<<(ostream&o,__int128 x){int D[50],c=0;if(x<0)o<<"-",x=-x;do{D[c++]=x%10;x/=10;}while(x);while(c)o<<D[--c];ros;}ostream&operator<<(ostream&o,__uint128_t x){int D[50],c=0;do{D[c++]=x%10;x/=10;}while(x);while(c)o<<D[--c];ros;}ostream&operator<<(ostream&o,__float128 x){ros<<(ld)x;}sim,class N oor pair<c,N>u){ros<<"<"<<lum(u.first)<<", "<<lum(u.second)<<">";}sim,typename=typename enable_if<!is_same<c,string>::value,urs(c().end())>::type oor c u){int q=0;o<<"{";for(auto e:u)o<<", "+2*!q++<<lum(e);ros<<"}_"<<q;}void dor(bool x){cerr<<dec<<"\033[0m"<<endl;}sim,class...N>void dor(int w,c x,N...y){cerr<<setprecision(uuv)<<boolalpha<<x<<"; "+2*w;dor(0,y...);}sim>string bte(c u){stringstream o;o<<setprecision(uuv)<<boolalpha<<lum(u);ros.str();}sim>struct nep;sim>c yyo(nep<c>);sim>nep<c>ngy(c,string,int m=0);sim>c yyo(c o){ros;}sim>struct nep{c v;string d;int m;nep<c>mask(){return ngy(v,d,1);}template<zub([],v[yyo(u)],N)d+"["+bte(u)+"]",rcu};sim>nep<c>ngy(c v,string d,int m){return nep<c>{v,d,m};}sim>c yyo(nep<c>o){ros.v;}sim>int uhn(c){return 0;}sim>int uhn(nep<c>o){ros.m;}
#undef g
#define ckx(o)template<zub(o,o yyo(u),nep<N>)#o+tfj(bte(u)),u.m);}
#define g(o)sim,zub(o,yyo(p)o u.v,c p,nep<N>)tfj(bte(p))+" " #o " "+tfj(bte(u)),uhn(p)+u.m);}
#define ccy(r...)sim>class enable_if<r is_integral<c>::value,string>::type ema(c u){
#define qel(t)sim,class d,class...e oor t<c,d,e...>r){ros<<*(d*)&r;}
qel(queue)qel(priority_queue)qel(stack)ccy(!)return bte(u);}ccy()stringstream o;o<<"[";int q=0;forbits(i,u)o<<", "+2*!q++<<lum(i);ros.str()+"]";}sim>string bte(nep<c>o){string v=(o.m?ema(o.v):bte(o.v));if(v==o.d)ros.d;ros.d+" = "+v;}sim oor nep<c>m){ros<<bte(rcu sim>nep<c>ngy(nep<c>o,string d="",int m=0){ros;}ckx(+)ckx(-)ckx(!)ckx(~)sim oor yda<c>M){if(M.p>=M.q||M.r>=M.s)ros<<"[------]";int l=0;stringstream p;vector<vector<string>>X;vector<int>Y(M.s-M.r,1);FOR(i,M.p,M.q-1){maxi(l,(int)bte(i).size());X.emplace_back();if(emz1(M.x,i)){auto V=emz2(M.x,i);FOR(j,M.r,M.s-1){if(emz1(V,j)){auto Q=emz2(V,j);X.back().push_back(bte(Q));maxi(Y[j-M.r],(int)X.back().back().size());}else X.back().push_back("3Ju+");}}}FOR(i,M.p,M.q-1){p<<"\n"<<setw(l)<<i<<": ";if(X[i-M.p].size())FOR(j,M.r,M.s-1){if(X[i-M.p][j-M.r]=="3Ju+")REP(_,Y[j-M.r])p<<"-";else p<<setw(Y[j-M.r])<<X[i-M.p][j-M.r];p<<"; ";}}p<<"\n";ros<<p.str();}vector<string>fdn;struct bcx{bcx(){fdn.push_back("");}~bcx(){fdn.pop_back();}};void imx(string m){cerr<<m<<"STACK TRACE: "<<dec<<"\033[0m"<<endl;for(auto x:fdn)cerr<<"\t"<<x<<"\033[0m"<<endl;}void ctm(bool r){fdn.back()+="\033[m";}sim,class...n>void ctm(bool r,c x,n...y){fdn.back()+=bte(x)+("; "+2*r);ctm(0,y...);}
#undef g
#define imie(a...) ngy(a,#a)
#define imask(a...) ngy(a,#a,1)
#define ra3(u,g,c) ngy(list<urs((u)[0])>(begin(u)+yyo(g),begin(u)+yyo(c)),#u "["+bte(g)+"..."+bte(c)+")")
#define ra2(i,j)ngy(list<urs(*(i))>(i,j),"[" #i "..." #j ")")
#define zoz(a,b,c,d,e...) d
#define range(r...) zoz(r,ra3,ra2)(r)
#define arr(a, i) imie(a)[imie(i)]
#define arr2(a, i, j) imie(a)[imie(i)][imie(j)]
#define print_stack(r...)::imx(vqx(__LINE__,__FUNCTION__,__PRETTY_FUNCTION__))
#define mark_stack(r...)bcx _;::ctm(1,vqx(__LINE__,__FUNCTION__,__PRETTY_FUNCTION__),r)
#define dump(a,i,j,k,q)ngy(nyb(a,yyo(i),yyo(j),yyo(k),yyo(q)),#a "["+bte(imie(i))+".."+bte(imie(j))+")["+bte(imie(k))+".."+bte(imie(q))+")")
#else
#define loc(...)
#define onl(r...)r
#define debug(...)
#define print_stack(...)
#define mark_stack(...)
#define set_pre(...)
#endif
#define next nexT
#define prev preV
#define tree trEE
#define left lefT
#define right righT
#define div diV
#define y1 y_1
ull mix(ull o){o+=0x9e3779b97f4a7c15;o=(o^(o>>30))*0xbf58476d1ce4e5b9;o=(o^(o>>27))*0x94d049bb133111eb;ros^(o>>31);}ull SALT=0x7a14a4b0881ebf9,tqu=0x7a14a4b0881ebf9;ull my_rand(){return tqu=mix(tqu);}void my_srand(ull x){SALT=tqu=x;}const int inf = 1023400000;const ll llinf=1234567890000000000ll;
#define rand my_rand
#define srand my_srand
#define random_shuffle(r...)random_shuffle(r,[](int _){return my_rand()%_;})
sim>inline c nux(c m){if(!m)return numeric_limits<c>::max();c A=m&-m;c B=~((A-1)^m);c C=B&-B;c D=(C>>(1+ctz(A)))-1;return C|(m&~(C-1))|D;}__attribute__((no_sanitize_undefined))ll mul(ll a,ll b,ll m){ll q=a*(ld)b/m;ll o=a*b-q*m;o%=m;if(o<0)o+=m;ros;}sim>void unq(c&x){x.resize(unique(ALL(x))-x.begin());}sim>c gcd(c o,c b){while(o&&b){int x=ctz(o),y=ctz(b);if(x>y)o>>=x-y;else b>>=y-x;if(o>b)o-=b;else b-=o;}ros?o:b;}sim>c lcm(c o,c b){ros/gcd(o,b)*b;}
sim>typename enable_if<is_integral<c>::value,ull>::type my_hash(c x){
	if(sizeof(c)>8) return mix((ull)x^SALT)^mix((ull)(x>>64)^SALT);
	return mix(x^SALT);
}
template<size_t N>ull my_hash(const bitset<N>&x){
	return mix(hash<bitset<N>>()(x)^SALT);
}
sim,class n>ull my_hash(const pair<c,n>&);
sim>gyv<ull,typename c::value_type>my_hash(const c&x){
	ull o=SALT;
	for(auto&d:x)o=mix(o^my_hash(d));
	ros;
}
sim,class n>ull my_hash(const pair<c,n>&x){return mix(my_hash(x.first))^my_hash(x.second);}
sim>struct my_hasher{size_t operator()(const c&o)const{return my_hash(o);}};
sim,class m>using _un0rDer3d_M4P=loc(unordered_map)onl(cc_hash_table)<c,m,my_hasher<c>>;
#define unordered_map _un0rDer3d_M4P
string join(const vector<string>&x){stringstream ans;ans<<"\n";for(const string&c:x)ans<<c<<"\n";return ans.str();}
sim,class F>auto get(F f,c x)->decltype(f[x]){return f[x];}
sim,class F>auto get(F f,c x)->decltype(f(x)){return f(x);}
vector<string>sp(string x){vector<string>ans(1);for(char c:x){if(c=='\n')ans.emplace_back();else ans.back().push_back(c);}rans;}
sim,class F,class G>vector<string>draw_tree_rec(c t,const c*p,F s,G d){auto C=get(s,t);auto r=sp(d(t));int lr=0;for(auto&x:r)maxi(lr,(int)x.size());if(C.empty()||(p&&C==urs(C){*p})){for(auto&q:r)q.resize(lr,' ');return r;}vector<string>ans(0);int le=0;vector<int>vs;bool prev=false;for(c x:C){if(p&&x==*p)continue;auto curr=draw_tree_rec(x,&t,s,d);for(int i=ans.size();i<(int)curr.size();++i)ans.push_back(string(le,' '));if(prev){for(int i=0;i<(int)ans.size();++i)ans[i]+=' ';le++;}prev=true;for(int i=0;i<(int)curr.size();++i)ans[i]+=curr[i];for(int i=curr.size();i<(int)ans.size();++i)ans[i]+=string(curr[0].size(),' ');vs.push_back(le+curr[0].size()/2);le+=curr[0].size();}if(lr>le){int ladd=(lr-le)/2,radd=(lr-le+1)/2;for(int&x:vs)x+=ladd;for(int i=0;i<(int)ans.size();++i)ans[i]=string(ladd,' ')+ans[i]+string(radd,' ');le=lr;}int up_i=le/2;int pos=0;string bot;for(int i=0;i<le;++i){bool down=false,up=i==up_i,in=false;if(pos==(int)vs.size())in=i<up_i;else if(i==vs[pos]){in=down=true;pos++;}else if(pos==0)in=i>up_i;else if(pos==(int)vs.size())in=i<up_i;else in=true;if(up&&down)bot+='+';else if(up)bot+='^';else if(down)bot+='v';else if(in)bot+='-';else bot+=' ';}int ladd=(le-lr)/2;for(auto&q:r){q=string(ladd,' ')+q;q+=string(le-q.size(),' ');}r.push_back(bot);ans.insert(ans.begin(),ALL(r));for(int i=1;i<(int)ans.size();++i)assert(ans[i].size()==ans[0].size());rans;}
sim,class F,class G>string draw_tree(c t,F s,G d){return join(draw_tree_rec(t,(c*)0,s,d));}
sim,class F>string draw_tree(c t,F s){return draw_tree(t,s,[](c x){return bte(x);});}
sim,class F,class G>string draw_tree(c t,c p,F s,G d){return join(draw_tree_rec(t,&p,s,d));}
sim,class F>string draw_tree(c t,c p,F s){return draw_tree(t,p,s,[](c x){return bte(x);});}
#define by_parents(p,n) [&](int xwb(vsu,__LINE__)){vector<int>o;for(int _=0;_<=(n);++_)if(p[_]==xwb(vsu,__LINE__)&&_!=xwb(vsu,__LINE__))o.push_back(_);ros;}
#if !defined(LOCAL) && !defined(LOCAL2)
void AssertEdge(int x, int y) {}
void AssertNoEdge(int x, int y) {}
void AssertAt(int x) {}
void AssertOdd() {}
void AssertEven() {}
#endif
int n;
const int nax = 607;
int subtask;
struct solve_general {
	vector <int> path[nax];
	pii solution[nax];
	void mark_solution(int a, int mid, int b) {
		AssertEdge(a, mid);
		AssertEdge(mid, b);
		debug("found", imie(a), imie(mid), imie(b));
		solution[a] = {mid, b};
		solution[b] = {mid, a};
	}
	void try_mark_solution(int where) {
		if (path[where].size() == 2u) {
			mark_solution(where, path[where][0], path[where][1]);
		}
	}
	void solve() {
		const ld mul = 0.8;
		other = -1;
		memset(p, -1, sizeof(p));
		memset(solution, -1, sizeof(solution));
		pii none = {-1, -1};
		ull seed = TIME;//0x6c9703376f03a286;
		cerr << __PRETTY_FUNCTION__ << " seed = " << seed << " mul = " << mul << endl;
		debug(imie(seed));
		srand(seed);
		int where = 1;
		while (true) {
			AssertAt(where);
			AssertEven();
			if (solution[where] != none) {
				debug("great; run Dfs", arr(solution, where));
				int mid = solution[where].first;
				int opp = solution[where].second;
				p[mid] = where;
				other = opp;
				MoveProbe(mid);
				visited[mid] = true;
				dfsOdd(mid);
				return;
			}
			if (path[where].empty()) {
				vector <int> ord0;
				vector <vector <int> > ords;
				FOR(i, 1, n) if (i != where) ord0.push_back(i);
				random_shuffle(ALL(ord0));
				REP(_, n - 1) {
					ords.push_back(ord0);
					rotate(ord0.begin(), ord0.begin() + 1, ord0.end());
				}
				random_shuffle(ALL(ords));
				bool is_star = true;
				for (vector <int> ord : ords) {
					int at = -1;
					REP(i, n - 1) {
						if (MoveProbe(ord[i])) {
							at = i;
							break;
						}
					}
					if (at == -1) {
						debug("retry", imie(ord));
						MoveProbe(where);
						continue;
					}
					path[where] = vector <int>(ord.begin(), ord.begin() + at + 1);
					try_mark_solution(where);
					is_star = false;
					debug("found", arr(path, where));
					where = ord[at];
					break;
				}
				if (is_star) {
					AssertAt(where);
					AssertEven();
					assert(where == 1);
					FOR(i, 1, n) FOR(j, i + 1, n) {
						if (i == 1) AssertEdge(i, j);
						else AssertNoEdge(i, j);
					}
					Examine();
					FOR(i, 2, n) {
						MoveProbe(i);
						Examine();
						MoveProbe(1);
					}
					assert(false);
				}
			}
			else {
				assert(path[where].size() >= 3u);
				debug(imie(where));
				FOR(i, 1, n) if (!path[i].empty()) debug(arr(path, i));
				int pref = path[where].size() * mul;
				if (pref == 0) pref++;
				if (pref == (int) path[where].size() - 1) pref--;
				REP(i, pref) {
					int _ = MoveProbe(path[where][i]); assert(!_);
				}
				if (MoveProbe(path[where].back())) {
					debug("clear", arr(path, where));
					path[where].erase(path[where].begin() + pref, path[where].end() - 1);
					debug("reaching", arr(path, where));
					try_mark_solution(where);
					where = path[where].back();
				}
				else {
					vector <int> rest;
					FOR(i, 1, n) if (i != where) rest.push_back(i);
					vector <bool> did(n + 1);
					REP(i, pref) did[path[where][i]] = 1;
					did[path[where].back()] = 1;
					debug("clear", arr(path, where));
					path[where].erase(path[where].begin(), path[where].begin() + pref);
					debug("reaching", arr(path, where), "but got lost");
					try_mark_solution(where);
					random_shuffle(ALL(rest));
					sort(ALL(rest), [this](int x, int y){return (path[x].empty() ? inf : path[x].size()) < (path[y].empty() ? inf : path[y].size());});
					rest.push_back(where);
					where = -1;
					for (int x : rest)
						if (!did[x] && MoveProbe(x)) {
							where = x;
							break;
						}
					assert(where != -1);
				}
			}
		}
	}
	bool visited[nax];
	int p[nax];
	int other;
	void dfsOdd(int i) {
		debug(imie(i));
		AssertAt(i);
		AssertOdd();
		Examine();
		vector <int> neis;
		FOR(a, 1, n) if (!visited[a]) {
			assert(a != i);
			if (MoveProbe(a)) {
				neis.push_back(a);
				MoveProbe(i);
				AssertEdge(i, a);
			}
			else
				AssertNoEdge(i, a);
		}
		random_shuffle(ALL(neis));
		for (int x : neis) {
			visited[x] = true;
			p[x] = i;
		}
		debug(imie(i), imie(neis));
		for (int x : neis) {
			MoveProbe(x);
			dfsEven(x);
			MoveProbe(i);
		}
	}
	void dfsEven(int i) {
		debug(imie(i));
		AssertAt(i);
		AssertEven();
		Examine();
		int v = p[i];
		int w = p[v];
		if (w == i) w = other;
		debug(imie(i), imie(v), imie(w));
		AssertEdge(i, v);
		AssertEdge(v, w);
		vector <int> neis;
		FOR(a, 1, n) if (!visited[a]) {
			assert(a != i);
			debug("test", imie(a));
			AssertNoEdge(a, v);
			bool found_edge = false;
			int _ = MoveProbe(a); assert(!_);
			int _ = MoveProbe(v); assert(!_);
			if (MoveProbe(w)) {
				int _ = MoveProbe(a); assert(!_);
				if (MoveProbe(i))
					found_edge = true;
				else {
					if (MoveProbe(v)) {
						AssertEdge(i, v);
						AssertEdge(v, w);
						AssertEdge(w, i);
						debug("play with cycle", imie(i), imie(v), imie(w));
						int _ = MoveProbe(w); assert(!_);
						int _ = MoveProbe(i); assert(_);
					}
					else {
						int _ = MoveProbe(w); assert(_);
						int _ = MoveProbe(v); assert(!_);
						int _ = MoveProbe(i); assert(_);
					}
				}
			}
			else {
				found_edge = true;
				AssertAt(a);
				AssertOdd();
				MoveProbe(i);
			}
			AssertAt(i);
			AssertEven();
			if (found_edge) {
				AssertEdge(a, i);
				neis.push_back(a);
			}
			else
				AssertNoEdge(a, i);
		}
		random_shuffle(ALL(neis));
		for (int x : neis) {
			visited[x] = true;
			p[x] = i;
		}
		debug(imie(i), imie(neis));
		for (int x : neis) {
			MoveProbe(x);
			dfsOdd(x);
			MoveProbe(i);
		}
	}
};
struct solve_bipartite {
	vector <int> propagate[nax][2];
	int which[nax];
	int solved;
	void solve() {
		cerr << __PRETTY_FUNCTION__ << endl;
		memset(which, -1, sizeof(which));
		int where = 1;
		solved = 0;
		put(1, 0);
		while (solved < n) {
			vector <int> ord;
			FOR(i, 1, n) if (i != where) ord.push_back(i);
			random_shuffle(ALL(ord));
			ord.push_back(where);
			int at = -1;
			REP(i, n) if (MoveProbe(ord[i])) {
				at = i;
				break;
			}
			assert(at != -1);
			put(ord[at], 0);
			put(ord[at - 1], 1);
			FOR(i, 0, at - 2)
				add_less(ord[i], ord[i + 1]);
			where = ord[at];
			AssertAt(where);
		}
		FOR(i, 1, n) FOR(j, i + 1, n) {
			assert(which[i] != -1 && which[j] != -1);
			if (which[i] != which[j]) AssertEdge(i, j);
			else AssertNoEdge(i, j);
		}
		int pick[2] = {-1, -1};
		FOR(i, 1, n) pick[which[i]] = i;
		FOR(i, 1, n) {
			if (which[where] == which[i]) {
				MoveProbe(pick[!which[where]]);
				MoveProbe(i);
			}
			else {
				MoveProbe(i);
			}
			AssertAt(i);
			Examine();
			where = i;
		}
	}
	void add_less(int x, int y) {
		add_prop(1, x, y);
		add_prop(0, y, x);
	}
	void add_prop(int i, int x, int y) {
		propagate[x][i].push_back(y);
		if (which[x] == i) put(y, i);
	}
	void put(int x, int i) {
		if (which[x] == i) return;
		assert(which[x] == -1);
		solved++;
		which[x] = i;
		debug(arr(which, x), imie(solved));
		for (int v : propagate[x][i])
			put(v, i);
	}
};
struct solve_123 {
	int p[nax];
	bool visited[nax];
	void dfs(int x) {
		debug(imie(x));
		AssertAt(x);
		AssertOdd();
		assert(!visited[x]);
		Examine();
		visited[x] = true;
		vector <int> edges;
		FOR(i, 1, n)
			if (!visited[i]) {
				if (MoveProbe(i)) {
					edges.push_back(i);
					p[i] = x;
					MoveProbe(x);
				}
				AssertAt(x);
				AssertOdd();
			}
		if (!edges.empty()) {
			flip(x);
			for (int i : edges) {
				if (visited[i]) continue;
				MoveProbe(i);
				dfs(i);
				int r = MoveProbe(x);
				assert(r);
			}
			flip(x);
		}
		AssertAt(x);
		AssertOdd();
	}
	void rotate() {
		AssertAt(1);
		MoveProbe(2);
		MoveProbe(3);
		MoveProbe(1);
		AssertAt(1);
	}
	void flip(int x) {
		if (x == 1) {
			rotate();
			return;
		}
		AssertAt(x);
		vector <int> back;
		int v = x;
		while (v != 1) {
			v = p[v];
			back.push_back(v);
		}
		debug(imie(x), imie(back));
		for (int i : back)
			MoveProbe(i);
		rotate();
		reverse(ALL(back));
		for (int i : back)
			if (i != 1) MoveProbe(i);
		MoveProbe(x);
		AssertAt(x);
	}
	void solve() {
		cerr << __PRETTY_FUNCTION__ << endl;
		if (n == 3) {
			Examine();
			MoveProbe(2);
			Examine();
			MoveProbe(3);
			Examine();
			assert(false);
		}
		rotate();
		dfs(1);
	}
};
struct solve_cycle {
	pair <int, vector <int> > go[nax];
	void solve() {
		cerr << __PRETTY_FUNCTION__ << endl;
		if (n == 3) {
			Examine();
			MoveProbe(2);
			Examine();
			MoveProbe(3);
			Examine();
			assert(false);
		}
		if (n == 4) {
			Examine();
			int opp = -1;
			for (int x : vector <int> {2, 3, 4, 2})
				if (MoveProbe(x)) {
					opp = x;
					break;
				}
			AssertAt(opp);
			Examine();
			vector <int> oth;
			FOR(i, 2, 4) if (i != opp) oth.push_back(i);
			MoveProbe(oth[0]);
			Examine();
			MoveProbe(1);
			MoveProbe(oth[1]);
			Examine();
			assert(false);
		}
		int where = 1;
		int prev = -1;
		do {
			vector <int> ord;
			FOR(i, 1, n) if (i != where) ord.push_back(i);
			random_shuffle(ALL(ord));
			REP(i, n - 1) ord.push_back(ord[i]);
			debug(imie(ord));
			int at = -1;
			REP(i, 2 * (n - 1))
				if (MoveProbe(ord[i])) {
					at = i;
					break;
				}
			assert(at != -1);
			int v = ord[at];
			AssertAt(v);
			if (v == prev) {
				debug("return from", imie(v));
				for (int x : go[v].second)
					MoveProbe(x);
				AssertAt(where);
			}
			else {
				go[where] = {v, vector <int>(ord.begin(), ord.begin() + at + 1)};
				prev = where;
				where = v;
			}
			assert(at != -1);
		}
		while (where != 1);
		FOR(i, 1, n) debug(arr(go, i));
		AssertAt(1);
		do {
			REP(i, go[where].second.size()) {
				MoveProbe(go[where].second[i]);
				if (n % 2 == 0 && i == go[where].second.size() - 2)
					Examine();
			}
			Examine();
			where = go[where].first;
		}
		while (where != 1);
	}
};
int main() {
	n = GetN();
	subtask = GetSubtask();
	if (subtask == 0) solve_general().solve();
	if (subtask == 1) solve_bipartite().solve();
	if (subtask == 2) solve_123().solve();
	if (subtask == 3) solve_cycle().solve();
	assert(false);
}