#include <bits/stdc++.h>
#include "dungeon2.h"
using namespace std;
#define pii pair<int,int>

vector<int> graph[203];
vector<int> typ[203];
vector<int> dek[203];
int wyn[203];
pii fat[203];
int deg[203];
int wolne=0;

void init(int v, int p){
	deg[v]=NumberOfRoads();
	graph[v].resize(deg[v]+1);
	typ[v].resize(deg[v]+1);
	dek[v].resize(deg[v]+1);
	if (v!=1){
		fat[v]={p,LastRoad()};
		graph[v][LastRoad()]=p;
		typ[v][LastRoad()]=-2;
	}
	for (int i = 1; i<=deg[v]; i++){
		if (i==fat[v].second)continue;
		Move(i,2);
		if (Color()==2){
			Move(LastRoad(),2);
			typ[v][LastRoad()]=1;
		}
		else if (Color()==3){
			Move(LastRoad(),3);
			typ[v][LastRoad()]=-1;
		}
		else{
			graph[v][i]=++wolne;
			init(wolne,v);
		}
	}
	if (v!=1)Move(fat[v].second,3);
}

void dfs(int v, int d){
	for (int i = 1; i<=deg[v]; i++){
		if (typ[v][i]==0){
			Move(i,(v/d)%3+1);
			dfs(graph[v][i],d);
		}
		if (typ[v][i]==1){
			Move(i,Color());
			dek[v][i]+=(d*(Color()-1));
			Move(LastRoad(),Color());
		}
	}
	Move(fat[v].second,1);
}

vector<int> final_graph[202];
int odl[202];

void bfs(int v, int n){
	fill(odl,odl+n+1,1000);
	queue<int> q;
	q.push(v);
	odl[v]=0;
	while(q.size()){
		int now=q.front();
		q.pop();
		for (auto u : graph[now])if (odl[u]>odl[now]){
			q.push(u);
			odl[u]=odl[now]+1;
			wyn[odl[u]]++;
		}
	}
	
}

void Inspect(int R){
	init(++wolne,0);
	int n=wolne,cur=1,dziel=3;
	for (int dziel = 3; dziel<=n; dziel*=3){
		dfs(1,dziel);
	}
	for (int i = 2; i<=n; i++){
		for (int j = 1; j<=deg[i]; j++){
			if (typ[i][j]==1)final_graph[i].push_back(dek[i][j]);
			else final_graph[i].push_back(graph[i][j]);
		}
	}
	for (int i = 1; i<=n; i++){
		bfs(i,n);
	}
	for (int i = 1; i<=R; i++){
		Answer(i,wyn[i]/2);
	}
}