#include "dungeon2.h"
#include <bits/stdc++.h>
using namespace std;

vector<pair<int,int> > sas[301];
vector<int> sas2[301];
vector<int> sas3[301];
vector<int> sas4[301];
int pt = 1;
void DFS(int v){
	int deg = NumberOfRoads();
	for (int i = 1; i <= deg; i++){
		Move(i,3);
		int cof = LastRoad();
		if (Color() == 3){
			sas2[v].push_back(i);
			sas3[v].push_back(0);
			Move(cof,3);
		}else if (Color() == 1){
			pt++;
			sas[v].push_back({pt,i});
			DFS(pt);
			Move(cof,2);
		}else{
			Move(cof,2);
		}
	}
}
int zwroc(int v, int bit){
	if (v&(1<<bit)) return 2;
	return 1;
}
void pokoloruj(int v, int bit){
	for (auto j : sas[v]){
		//cout<<"bit = "<<bit<<" Kolorujemy "<<v<<" na "<<zwroc(v,bit)<<"\n";
		Move(j.second,zwroc(v,bit));
		int cof = LastRoad();
		pokoloruj(j.first,bit);
		Move(cof,zwroc(j.first,bit));
	}
}
void DFS2(int v, int bit){
	for (int i = 0; i < (int)sas2[v].size(); i++){
		Move(sas2[v][i],zwroc(v,bit));
		if (Color() == 2) sas3[v][i] += (1<<bit);
		Move(LastRoad(),Color());
	}	
	for (auto j : sas[v]){
		Move(j.second,zwroc(v,bit));
		int cof = LastRoad();
		DFS2(j.first,bit);
		Move(cof,Color());
	}	
}
void Inspect(int R){
	DFS(1);
	for (int i = 0; i < 8; i++){
		DFS2(1,i);
	}
	int odl[max(R+1,pt+1)];
	for (int i = 0; i <= R; i++) odl[i]= 0 ;
	for (int v = 1; v <= pt; v++){
		for (auto j : sas[v]){
			sas4[v].push_back(j.first);
			sas4[j.first].push_back(v);
		}
		for (int u : sas3[v]){
			sas4[v].push_back(u);
			sas4[u].push_back(v);
		}		
	}
	for (int v = 1; v <= pt; v++){
		int dist[pt+1];
		for (int u = 1; u <= pt; u++) dist[u] = -1;
		queue<int> Q;
		Q.push(v);
		dist[v] = 0;
		while (Q.size()){
			int u = Q.front();
			Q.pop();
			for (int z : sas4[u]){
				if (dist[z] == -1){
					dist[z] = dist[u]+1;
					Q.push(z);
				}
			}	
		}
		for (int u = v+1; u <= pt; u++){
			if (dist[u] == -1) continue;
			odl[dist[u]]++;
		}
	}
	for (int i = 1; i <= R; i++){
		//cout<<i<<" "<<odl[i]<<"\n";
		Answer(i,odl[i]);
	}
}