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

vector<vector<int>> g (60, vector<int>());
vector<int> o (60, 0);
int poz = 2;
int ilew = 1;

void dfs (int v) {
    int x = NumberOfRoads();
    for (int i = 1; i < x+1; i++) {
        Move(i, v);
        int kp = LastRoad();
        if (o[Color()] == i) {
            continue;
        }
        if (Color() == 1) {
            ilew++;
            int u = ilew+1;
            o[u] = v;
            dfs(u);
            g[v].push_back(u);
            g[u].push_back(v);
        }
        else {
            g[v].push_back(Color());
            g[Color()].push_back(v);
        }
        Move(kp, Color());
    }
}

void Inspect(int R) {
    dfs(2);
    vector<int> w (60, 0);
    for (int i = 2; i < ilew+2; i++) {
        queue<int> q;
        vector<int> dl (ilew+2, 10000000);
        q.push(i);
        dl[i] = 0;
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            for (int u : g[v]) {
                if (dl[u] != 10000000) {
                    dl[u] = dl[v]+1;
                    w[dl[u]]++;
                    q.push(u);
                }
            }
        }
    }
    for (int i = 1; i < R+1; i++) {
        Answer(i, w[i]/2);
    }
}